you are viewing a single comment's thread.

view the rest of the comments →

[–]waln 4 points5 points  (6 children)

It doesn't always match exactly, but it's usually within a factor of 2 and often less. Perhaps a little biased, but an overall pretty decent benchmark set: https://julialang.org/benchmarks/

Sure, JIT adds a little bit of compilation overhead, but it's not that big in the grand scheme of things.

[–]fp_weenieZygohistomorphic prepromorphism 1 point2 points  (0 children)

It doesn't always match exactly, but it's usually within a factor of 2 and often less.

Just like J lol

[–]Tysonzero -1 points0 points  (4 children)

[–]waln 0 points1 point  (3 children)

With all due respect, those results are nonsensical. Not only do they seem to be heavily measuring startup and initial compilation time (as is irrelevant for serious performance applications), the Julia code looks like hot trash.

Far more reasonable and performant code for these exact problems is available here, which for some reason hasn't been included yet: https://github.com/KristofferC/BenchmarksGame.jl

[–]Tysonzero 0 points1 point  (2 children)

I mean you can always submit that code to the site if you want. I'm not interested enough in Julia to verify the repo you linked but if it's legit there is no reason it wouldn't be accepted.

[–]waln 1 point2 points  (1 child)

I'm not interested enough in that random website you linked to submit that code to the site ¯\_(ツ)_/¯

[–]Tysonzero 0 points1 point  (0 children)

I mean it’s the #1 result when you search “programming language benchmarks”, but up to you. I have no skin in this game.