A. S. To prevent any confusion: at the time when this was originally posted, Julia’s run was about 600ms and was ~20x slower than Rust. This is not longer the case. Resuming the original post… … → I stumbled upon this funny benchmark with Julia at the bottom of the list. They (whoever wrote tha…

[jlfast] No more comment. Thanks @Lilith for spotting and fixing this: [Julia] move `topn` definition into body of `@threads` jinyus:main ← LilithHafner:lh/julia_con-opt opened 10:30PM - 10 Oct …

[image] Dan: I think there are many times a Dict is known to have keys from a small universe, and speed is paramount. Go implementation seems to do this (using the knowledge that there are max 100 tags). The Dictionaries.jl supports a size hint, but in the current scenario, seems slower than…

[image] algunion: function fastmaxindex!(xs::Vector{Int}, topn, maxn, maxv) I realized that this whole function can be replaced by partialsortperm!() except that it’s much slower right now: @@ -69,27 +51,33 @@ function related(posts) relatedposts = Vector{RelatedPost}(undef, length(post…

[julia] add comments, reduce getindex(), use MVector to speed up by Moelf · Pull Request #162 · jinyus/related_post_gen · GitHub I think MVector and not checking if > ... every single time with getindex() helped reduce runtime by 33%, I checked the output diff seems okay: > diff related_posts_julia…

If I understand correctly, that finds the topn largest values in a list ? (edit: index of the ntop largest values) If so, you might look into this [image] Find n smallest values in an n dims array New to Julia Thanks guys. This should be included somewhere in Julia

we need the index of topn largest values in a list, which is precise partialsortperm( ;rev=true), but it’s much slower

That is then exactly (?) what was discussed [image] Find n smallest values in an n dims array New to Julia Thanks guys. This should be included somewhere in Julia but for the minimum.

[image] jling: partialsortperm sortperm and friends are really slow in Julia sortperm has poor performance · Issue #939 · JuliaLang/julia · GitHub Also, partialsort dispatches between partial-scratch-quicksort (good for long inputs) and insertionsort of the whole input (good for short inputs…

[julia] put Julia code into a project better precompile jinyus:main ← Moelf:main opened 02:33PM - 08 Oct 23 UTC (UTC) [Moelf] Moelf …

Current results: [image] The underlying data (used for the leaderboard) is changing from run to run, and it seems to affect the results regardless of underlying implementations. For example, Zig was not updated in 4 days and jumped on top for the current run (the same implementation a day back d…

this function has the funny property that if I add @inbounds it actually becomes slower (given we’re using MVector now)

Funny Benchmark with Julia (no longer) at the bottom

General Usage Performance

JM_Beckers October 8, 2023, 12:30pm 24

That is then exactly (?) what was discussed

but for the minimum.

Topic		Replies	Views
Julia programs now shown on benchmarks game website Community announcement	144	14836	December 3, 2019
Help to get my slow Julia code to run as fast as Rust/Java/Lisp Performance	100	5401	August 6, 2021
Shouldn't 1.8.0 be faster than Julia 1.7? Performance	30	2755	September 16, 2022
Benchmark game challenge and some optimization questions Performance	29	3048	January 13, 2024
Yet another language benchmark Performance benchmark	9	1129	June 15, 2025

Funny Benchmark with Julia (no longer) at the bottom

Related topics