OUT-OF-DATE! Read http://shootout.alioth.debian.org/      

- all benchmarks - n-body fannkuch (deprecated) meteor-contest fasta spectral-norm reverse-complement mandelbrot k-nucleotide regex-dna pidigits chameneos-redux thread-ring binary-trees hello-world sum-file nsieve nsieve-bits partial-sums recursive - all languages - C Cyclone C GNU gcc C++ GNU g++ D Digital Mars D GNU Dylan Gwydion Eiffel SmartEiffel Forth bigForth Forth GNU GForth Icon Io Matlab GNU Octave Nice Oberon-2 OO2C Objective-C GNU Parrot PIR Pike Prolog SWI Rexx Regina S-Lang SML MLton SML SML/NJ Tcl

÷ C Cyclone C GNU gcc C++ GNU g++ D Digital Mars D GNU Dylan Gwydion Eiffel SmartEiffel Forth bigForth Forth GNU GForth Icon Io Matlab GNU Octave Nice Oberon-2 OO2C Objective-C GNU Parrot PIR Pike Prolog SWI Rexx Regina S-Lang SML MLton SML SML/NJ Tcl

 Step 1 : Are the programs faster? At a glance.

This chart shows 3 comparisons - Time-used, Memory-used and Code-used ~ speed and size.

Each chart bar shows, for one unidentified benchmark, how much the fastest program used compared to the fastest program.

Look at speed another way - look at a box plot of Time-used data.

 Step 2 : Are the programs faster? Approximately.

This table shows 3 comparisons - Time-used, Memory-used and Code-used ~ speed and size.

Each table row shows, for one named benchmark, how much the fastest program used compared to the fastest program.

used what fraction? used how many times more?
Benchmark	Time	Memory	Code
pidigits	1/5	±	±
reverse-complement	±	±	1/2
fasta	±	±	1/2
nsieve-bits	±	±	±
nsieve	±	±	1/2
spectral-norm	±	6×	1/2
partial-sums	±	±	±
k-nucleotide	±	1/2	1/2
n-body	2×	±	±
recursive	2×	2×	±
mandelbrot	2×	±	±

used what fraction? used how many times more?
Time-used	|-	|---	25%	median	75%	---|	-|
(CPU secs)	1/5	1/5	±	±	2×	2×	2×

± read the measurements and then read the program source code.

 Step 3 : Are the programs faster? Measurements.

This table shows 5 measurements - CPU Time, Elapsed Time, Memory, Code and ≈ CPU Load ~ speed and size.

For each named benchmark, measurements of the fastest program are shown for comparison against measurements of the fastest program.

Program Source Code	CPU secs	Elapsed secs	Memory KB	Code B	≈ CPU Load
pidigits
	2.94		3,144	560
	14.34		3,116	644
reverse-complement
	1.05		45,716	540
	1.48		43,096	1064
fasta
	22.47		3,132	984
	24.51		3,116	1513
nsieve-bits
	4.36		5,048	413
	4.55		4,876	534
nsieve
	1.77		9,404	295
	1.83		9,344	465
spectral-norm
	18.67		18,528	369
	18.10		3,108	660
partial-sums
	2.09		3,136	508
	1.94		3,088	577
k-nucleotide
	13.10		32,048	845
	11.62		66,100	1762
n-body
	35.65		620	1239
	17.37		508	1722
recursive
	7.04		1,112	389
	3.37		612	494
mandelbrot
	7.72		3,368	444
	3.62		3,292	639
binary-trees
	No program
	0.13		10,596	627
regex-dna
	1.28		14,752	615
	No program

 Step 4 : Are there other programs for these benchmarks?

Remember - those are just the fastest and programs measured on this OS/machine. Check if there are other implementations of these benchmark programs for .

C Cyclone C GNU gcc C++ GNU g++ D Digital Mars D GNU Dylan Gwydion Eiffel SmartEiffel Forth bigForth Forth GNU GForth Icon Io Matlab GNU Octave Nice Oberon-2 OO2C Objective-C GNU Parrot PIR Pike Prolog SWI Rexx Regina S-Lang SML MLton SML SML/NJ Tcl

Maybe one of those other programs is fastest on a different OS/machine.

 Step 5 : Are there other faster programs for these benchmarks?

Remember - those are just the fastest and programs measured on this OS/machine. Check if there are faster implementations of these benchmark programs for other programming languages.

n-body fannkuch (deprecated) meteor-contest fasta spectral-norm reverse-complement mandelbrot k-nucleotide regex-dna pidigits chameneos-redux thread-ring binary-trees hello-world sum-file nsieve nsieve-bits partial-sums recursive

Maybe one of those other programs is fastest on a different OS/machine.

  :  

The Objective Caml native-code compiler, version 3.10.0

Home Page: http://www.ocaml.org/

Download: http://caml.inria.fr/download.en.html

  Home   Conclusions   License   Help