Yeah. I think the benchmark game entries for Julia are unfortunately poor / stylised - IIRC there was a fork that delivered actually fast implementations (at the cost of some prettiness), but I don't think it ever got merged in.

I do agree that there a few cases where Julia in theory could do what you wanted, but it's a bit awkward to get the guarantee from the compiler that it will do so (e.g. SIMD this thing, constexpr this thing..). I do hope this situation improves.

It's really quite easy to guarantee the compiler uses SIMD in Julia, it just takes a bit of reading the docs and understand the Zen of Julia.

I would like someone good at Julia to tighten up those programs. benchmark game still takes submission right?

I updated the Julia n body problem to use simd. It's actually really easy to read and I'm pretty confident it's very performant, but the problem is that for the number of iterations done, the VM boot time dominates. If you were doing a problem IRL, you would expect run times in the hours, and a 5 second vm load and program compile penalty would be peanuts.

which implementation is that? 2 is the fastest but it doesn't use any .* or the like, an 3 which does and has "vectorised" in the comments is actually half the speed of 2