benchmarksgame-rs VS Primes

Compare benchmarksgame-rs vs Primes and see what are their differences.


The Computer Language Benchmarks Game: Rust implementations (by TeXitoi)
Our great sponsors
  • SonarQube - Static code analysis for 29 languages.
  • Scout APM - Less time debugging, more time building
  • SaaSHub - Software Alternatives and Reviews
benchmarksgame-rs Primes
1 32
66 1,848
- 1.6%
0.0 8.9
over 2 years ago about 1 month ago
Rust C#
GNU General Public License v3.0 or later -
The number of mentions indicates the total number of mentions that we've tracked plus the number of user suggested alternatives.
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.


Posts with mentions or reviews of benchmarksgame-rs. We have used some of these posts to build our list of alternatives and similar projects. The last one was on 2021-04-13.


Posts with mentions or reviews of Primes. We have used some of these posts to build our list of alternatives and similar projects. The last one was on 2022-06-22.
  • Being 500x faster than python still means it's 10x slower than C
    6 projects | | 22 Jun 2022
    And here's the github repo.
  • Upcomming language to try?
    4 projects | | 15 May 2022
  • Could this code calculating primes be much more optimized?
    5 projects | | 9 May 2022
    After a quick glance - using assert is very likely to be slower than passing state/lists/whatever around using arguments.
    5 projects | | 9 May 2022
    I clicked on the 1 in the Solution column next to one of the Prolog entries, and it took me to the Github folder for that code and I saved the one to my computer and ran it with swipl (SWI version 8.4). It did this:
    5 projects | | 9 May 2022
    So here's the code they used for running primes in prolog
    5 projects | | 9 May 2022
    That's worse than the kind of difference I was expecting; but still, it's a micro-optimization benchmark which depends on being able to have fine control over not overflowing the CPU caches, and enough people willing to spend a lot of effort tuning. Or cheating; this Lisp one seems to calculate the Primes as a reader-macro-expansion, before compile time, then runtime is ridiculously fast.
  • Come on python
    1 project | | 9 Mar 2022
    This, again sounds just like the juniors or inturns with arguments that don't get to the point. Yes you can with great effort write C code less efficient than python code written by one of the top experts but that's not an argument nor is it realistic. Yes some people can save some time when writing exceptionally large projects, but that small use case does not negate my point. When you have a large dataset to crunch time matters. When you have server side code efficiency adds up in server costs, when you are crunching streaming data every last clock cycle counts and the time differences can be extreme. The smallest difference I ever noticed in a port was 2.6x improvement, that adds up quickly. Let's use Dave Plumber's programming language drag race as an example This is likely the single most contributed to multi language code benchmarking tool and the fastest single threaded C++ implementation was 25,695x faster than the fastest python implementation. 2.5x and 25,695x all adds up with server time, the longevity of the project and the environmental impact of your code.
  • Math.Sqrt is fantastically slow on AMD 9 3900X 12 core, it was destroyed by small 4 core mobile CPU from Intel. Is there somebody with i9 12900K?
    2 projects | | 13 Dec 2021
  • "The Genuine Sieve of Eratosthenes"
    2 projects | | 12 Dec 2021
    I actually wrote a Clojure implementation of the Sieve of Eratosthenes a few months ago for a programming language speed comparison.
  • The big idea around unikernels
    5 projects | | 3 Dec 2021
    A bit OT: what kind of performance do you normally expect from OCaml? I looked at the Prime Sieve challenge[1] recently and with the current submissions the Standard ML solution is 3 times faster than the OCaml one. I've also spent some time optimizing this SML solution and got it several times faster still. With a bit more work I thinkg I could get it up to the speed of the fastest C solution. It's compiled with MLton. From that POV OCaml is a bit disappointing, since I've also viewed SML as a "hipster language" that hasn't had that much money put into it, while OCaml saw quite a bit more development, so I would expect the OCaml compiler to be able to produce better code. I've briefly looked at the OCaml code, but I don't know OCaml as much as SML, so can't really say what may be the issue in the OCaml case.

    [1]: <>

    [2]: <>

What are some alternatives?

When comparing benchmarksgame-rs and Primes you can also consider the following projects:

primesieve - 🚀 Fast prime number generator

PrimesResult - The results of the Dave Plummer's Primes Drag Race

RoaringBitmap - A better compressed bitset in Java

zig - General-purpose programming language and toolchain for maintaining robust, optimal, and reusable software.

rust - Rust for the xtensa architecture. Built in targets for the ESP32 and ESP8266

LMRTFY - Let Me Run That For You: A C++20 Thread Pool Library

Mudlet - ⚔️ A cross-platform, open source, and super fast MUD client with scripting in Lua

pictoprime - Generate prime numbers from pictures!

tokio - A runtime for writing reliable asynchronous applications with Rust. Provides I/O, networking, scheduling, timers, ...

Rustlings - :crab: Small exercises to get you used to reading and writing Rust code!

mpp - A modern C++ matrix library

Arraymancer - A fast, ergonomic and portable tensor library in Nim with a deep learning focus for CPU, GPU and embedded devices via OpenMP, Cuda and OpenCL backends