You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
 
 
 
 
 
 
Vitaliy Filippov b07c3cec4c Same result format for primes-alt.java 5 months ago
cpp-optimizations Initial commit 5 years ago
dotnet Make the ".NET Core Linux" project files compatible with version 3.1.x 2 years ago
java-optimizations LinkedList info 5 years ago
results A quick benchmark redo for ".NET Core Linux" version 3.1.1 2 years ago
LICENSE Initial commit 5 years ago
README.md Port of the Python version to D 3 years ago
primes-alt.java Same result format for primes-alt.java 5 months ago
primes-alt.lua Add alternative Lua implementation without #arr 5 months ago
primes.cpp Print comparable results 1 year ago
primes.d Port of the Python version to D 3 years ago
primes.dotnet Symlink to the C# .NET Core implementation 5 years ago
primes.erl Add 2 more Erlang implementations. But shit anyway 1 year ago
primes.go Add lua + change cpp, js, rust and php, python, go to 30 iterations 2 years ago
primes.java Same result format for primes-alt.java 5 months ago
primes.js Print comparable results 1 year ago
primes.lua Print comparable results 1 year ago
primes.php Print comparable results 1 year ago
primes.pl Same format with perl 1 year ago
primes.py Print comparable results 1 year ago
primes.rb Limit running time by an ENV variable 5 years ago
primes.rs Same format with perl 1 year ago
primes.swift Minor refactoring, so that the code workflow is the same as the other languages 3 years ago
run.sh Port of the Python version to D 3 years ago

README.md

langs-performance

C++ vs. Python vs. Perl vs. PHP vs. Java vs. NodeJS vs. Go vs. Ruby vs. Rust vs. Swift vs. D performance benchmark

Blog articles:

The benchmarks here do not try to be complete, as they are showing the performance of the languages in one aspect, and mainly: loops, dynamic arrays with numbers, basic math operations.

The times include the interpretation/parsing phase for each language, but it’s so small that its significance is negligible. The programs run for 90 wall-clock seconds and there are 6 identical runs, in order to have more reliable results. All scripts are using the very same algorithm to calculate the prime numbers in a given range. The correctness of the implementation is not so important, as we just want to check how fast the languages perform. The original Python algorithm was taken from http://www.daniweb.com/code/snippet216871.html.

Another similar project: https://benchmarksgame.alioth.debian.org/