Performance comparison, Julia is a slower than Mojo, am I doing something wrong?

[giordano]

I get 29 seconds on 1.9.3, and 33 on 1.10.0-beta2, and pretty much the same as 1.10 on master.

But just to say how much useful is this benchmark, try

Simple recursive Fibonaci example. How to make it faster?

As noted above, it is probably TCO and/or unrolling. We can also do all kinds of tricks, eg function fibval(::Val{N}) where N if N ≤ 1 1 else fibval(Val{N - 1}()) + fibval(Val{N - 2}()) end end julia> @time fibval(Val(46)) # first run, includes complilation time 0.057667 seconds (166.50 k allocations: 9.972 MiB, 22.78% gc time) julia> @time fibval(Val(46)) # let's benchmark Base.show 0.000182 seconds (4 allocations: 160 bytes) These things are fun, but they t…