3 ms·

These are small benchmarks, so don’t over-generalize from this data point alone, but Racket absolutely crushes Python in terms of speed and goes speedily enough

These are small benchmarks, so don’t over-generalize from this data point alone, but Racket absolutely crushes Python in terms of speed and goes speedily enough against other popular performance-focused languages: https://lambdaland.org/posts/2023-12-20_functional_langauge_speed/ https://lambdaland.org/posts/2023-12-20_functional_langauge_... https://lambdaland.org/posts/2024-09-27_threaded_interpreter/ https://lambdaland.org/posts/2024-09-27_threaded_interpreter... Matthew Flatt, the Racket lead, says that Racket’s performance should be fairly comparable to Java, much faster than Python, slower than Julia/Rust/etc. That’s been a helpful model for me: if Java is fast enough, Racket will do fine.

gus_massa 11mo ago
Nice examples! With a few tricks, I made the Racket program x5 faster. I think you tried to use the simplest program, so I tried to add as few cheats as possible. I added a happy path for fixnums and keep the slow path in case the iterations gets too big: (define (count-collatz n [cnt 1]) (if (fixnum? n) (cond [(= n 1) cnt] #;[(zero? (unsafe-fxremainder n 2)) (count-collatz (unsafe-fxquotient n 2) (+ 1 cnt))] [(zero? (fxand n 1)) (count-collatz (unsafe-fxquotient n 2) (+ 1 cnt))] [else (count-collatz (+ (* 3 n) 1) (+ 1 cnt))]) (cond [(= n 1) cnt] [(even? n) (count-collatz (/ n 2) (+ 1 cnt))] [else (count-collatz (+ (* 3 n) 1) (+ 1 cnt))]))) My program has two versions, the version with `fxand` is slightly faster than the versions with `fxremainder`. I have to used two `unsafe-` functions, but a smart enough optimizer should have fixed them. So I'm adding this example to my wishlist. I think it would be very hard for the optimizer would be to replace `/` with `quotient`, but the rest look possible.

gus_massa 11mo ago

Nice examples! With a few tricks, I made the Racket program x5 faster. I think you tried to use the simplest program, so I tried to add as few cheats as possible. I added a happy path for fixnums and keep the slow path in case the iterations gets too big: (define (count-collatz n [cnt 1]) (if (fixnum? n) (cond [(= n 1) cnt] #;[(zero? (unsafe-fxremainder n 2)) (count-collatz (unsafe-fxquotient n 2) (+ 1 cnt))] [(zero? (fxand n 1)) (count-collatz (unsafe-fxquotient n 2) (+ 1 cnt))] [else (count-collatz (+ (* 3 n) 1) (+ 1 cnt))]) (cond [(= n 1) cnt] [(even? n) (count-collatz (/ n 2) (+ 1 cnt))] [else (count-collatz (+ (* 3 n) 1) (+ 1 cnt))]))) My program has two versions, the version with `fxand` is slightly faster than the versions with `fxremainder`. I have to used two `unsafe-` functions, but a smart enough optimizer should have fixed them. So I'm adding this example to my wishlist. I think it would be very hard for the optimizer would be to replace `/` with `quotient`, but the rest look possible.