Each chart bar shows how many times slower, one ↓ chameneos-redux program was, compared to the fastest program.
These are not the only programs that could be written. These are not the only compilers and interpreters. These are not the only programming languages.
Column × shows how many times more each program used compared to the benchmark program that used least.
|×||Program Source Code||CPU secs||Elapsed secs||Memory KB||Code B||≈ CPU Load|
|1.0||MicroPython #2||130.47||60.34||4,576||1191||55% 48% 44% 51%|
|1.0||MicroPython||131.00||60.53||4,576||1191||56% 48% 45% 49%|
|1.1||Pyston||152.83||68.08||25,528||1192||50% 54% 47% 54%|
|1.4||PyPy 2||175.47||85.67||74,172||1192||51% 47% 44% 45%|
|1.7||PyPy 3 #2||195.51||101.40||66,032||1191||49% 41% 43% 42%|
|1.7||PyPy 3||197.00||102.62||66,088||1191||49% 40% 42% 41%|
|1.9||Python 2||287.09||114.88||6,940||1192||62% 61% 61% 60%|
|2.8||Cython||5 min||166.10||8,460||1203||50% 45% 47% 44%|
|2.8||Nuitka||5 min||170.20||10,516||1191||49% 45% 46% 45%|
|2.8||Nuitka #2||5 min||171.31||10,360||1191||50% 45% 45% 45%|
|2.8||Python 3||5 min||171.33||8,680||1191||49% 44% 46% 43%|
|2.8||Python 3 #2||5 min||171.44||8,708||1191||49% 46% 45% 43%|
|2.9||Python development version||5 min||172.83||7,960||1191||48% 44% 45% 43%|
|2.9||Python development version #2||5 min||175.27||7,900||1191||49% 45% 46% 44%|
|missing benchmark programs|
ndiff program output N = 600 with this output file to check your program output has the correct format before contributing.
We are trying to show the performance of various programming language implementations - so we ask that contributed programs not only give the correct result, but also use the same algorithm to calculate that result.
The text-part and spelled-out numbers in the program output should match the expected output exactly. Thread scheduling may cause small differences in the other numbers, so program output is checked with ndiff -fields 2-10
Each program should
The chameneos benchmark is an adaptation of "Chameneos, a Concurrency Game for Java, Ada and Others" 100KB pdf (which includes example implementations in Java, Ada and C).
Programs may use pre-emptive kernel threads or pre-emptive lightweight threads; but programs that use non pre-emptive threads (coroutines, cooperative threads) and any programs that use custom schedulers, will be listed as interesting alternative implementations. Briefly say what concurrency technique is used in the program header comment.