4 ms·

I'm a Rust evangelist, but the article is titled "Speed of Rust vs. C" and doesn't seem to contain even one benchmark. For fuck's sake.

tazjin 6y ago
In my opinion, the level of detail in this article is much more useful than small benchmarks of code that doesn't resemble real applications anyways.
zesterer 6y ago
Benchmarks wouldn't tell the whole story. This detailed writeup is far better in that it gives information about how and where the two languages differ.
pornel 6y ago
There's already The Benchmarks Game and ixy-languages if you want hard numbers. Maximum speeds are already explored. I wanted to discuss an aspect that's not typically covered by pure benchmarks: what can you expect from normal day-to-day use of these languages. Not fine-tuned hot loops, but a "median" you can expect when you just need to get shit done. If I tried to write a benchmark code to represent average, practical, idiomatic, but less-than-maximally optimized code, I don't think anyone would believe me that's a fair comparison. So I describe problems and patterns instead, and leave it to readers to judge how much applies to their problems and programming style.
- howinteresting 6y ago
  Thank you for writing this. Real world, qualitative experience reports are vital. My experience using Rust vs C aligns with yours as well.
- igouy 6y ago
  > Maximum speeds are already explored. Also sub-maximum speeds — start at the bottom of the measurements and work up from the 5.37s g++ program to the 0.72s g++ program :-) https://benchmarksgame-team.pages.debian.net/benchmarksgame/performance/spectralnorm.html https://benchmarksgame-team.pages.debian.net/benchmarksgame/...
- igouy 6y ago
  Or start at the bottom of the measurements and work up from the 28.55s g++ program to the 0.84s g++ program :-) https://benchmarksgame-team.pages.debian.net/benchmarksgame/performance/mandelbrot.html https://benchmarksgame-team.pages.debian.net/benchmarksgame/...
majjgepolja 6y ago
Here's my completely unbiased benchmark which use different data structure, uses outside library in one language and non recursive implementation. I hope you don't need the link.

tazjin 6y ago

In my opinion, the level of detail in this article is much more useful than small benchmarks of code that doesn't resemble real applications anyways.

zesterer 6y ago

Benchmarks wouldn't tell the whole story. This detailed writeup is far better in that it gives information about how and where the two languages differ.

pornel 6y ago

There's already The Benchmarks Game and ixy-languages if you want hard numbers. Maximum speeds are already explored. I wanted to discuss an aspect that's not typically covered by pure benchmarks: what can you expect from normal day-to-day use of these languages. Not fine-tuned hot loops, but a "median" you can expect when you just need to get shit done. If I tried to write a benchmark code to represent average, practical, idiomatic, but less-than-maximally optimized code, I don't think anyone would believe me that's a fair comparison. So I describe problems and patterns instead, and leave it to readers to judge how much applies to their problems and programming style.

howinteresting 6y ago
Thank you for writing this. Real world, qualitative experience reports are vital. My experience using Rust vs C aligns with yours as well.
igouy 6y ago
> Maximum speeds are already explored. Also sub-maximum speeds — start at the bottom of the measurements and work up from the 5.37s g++ program to the 0.72s g++ program :-) https://benchmarksgame-team.pages.debian.net/benchmarksgame/performance/spectralnorm.html https://benchmarksgame-team.pages.debian.net/benchmarksgame/...
igouy 6y ago
Or start at the bottom of the measurements and work up from the 28.55s g++ program to the 0.84s g++ program :-) https://benchmarksgame-team.pages.debian.net/benchmarksgame/performance/mandelbrot.html https://benchmarksgame-team.pages.debian.net/benchmarksgame/...

majjgepolja 6y ago

Here's my completely unbiased benchmark which use different data structure, uses outside library in one language and non recursive implementation. I hope you don't need the link.