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 - BASIC FreeBASIC C GNU gcc C++ GNU g++ CAL Clean D Digital Mars Eiffel SmartEiffel Forth bigForth Forth GNU GForth Groovy Icon Io Lisaac Mercury Nice Oberon-2 OO2C Pike Prolog SWI Prolog YAP Rebol SML MLton SML SML/NJ Tcl Zonnon Mono

÷ BASIC FreeBASIC C GNU gcc C++ GNU g++ CAL Clean D Digital Mars Eiffel SmartEiffel Forth bigForth Forth GNU GForth Groovy Icon Io Lisaac Mercury Nice Oberon-2 OO2C Pike Prolog SWI Prolog YAP Rebol SML MLton SML SML/NJ Tcl Zonnon Mono

 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 Zonnon Mono 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 Zonnon Mono program.

used what fraction? used how many times more?
Benchmark	Time	Memory	Code
n-body	1/2	3×	±
nsieve	±	4×	±

used what fraction? used how many times more?
Time-used	|-	|---	25%	median	75%	---|	-|
(CPU secs)	1/2	1/2	1/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 Zonnon Mono program.

Program Source Code	CPU secs	Elapsed secs	Memory KB	Code B	≈ CPU Load
n-body
	22.53		16,952	1363
Zonnon Mono	34.61		5,168	1524
nsieve
	3.31		37,488	351
Zonnon Mono	2.32		9,744	368
recursive
	0.32		16,864	523
Zonnon Mono	Failed
k-nucleotide
	0.49		23,112	1435
	No program
partial-sums
	0.32		16,844	505
Zonnon Mono	Failed
reverse-complement
	0.28		16,748	896
	No program
mandelbrot
	0.28		16,736	653
	No program
fasta
	0.62		16,824	1419
	No program
pidigits
	0.48		27,000	645
	No program
regex-dna
	2.44		63,328	586
	No program
binary-trees
	0.43		21,320	553
	No program
spectral-norm
	0.49		16,996	625
	No program
nsieve-bits
	1.47		17,900	376
	No program

 Step 4 : Are there other programs for these benchmarks?

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

BASIC FreeBASIC C GNU gcc C++ GNU g++ CAL Clean D Digital Mars Eiffel SmartEiffel Forth bigForth Forth GNU GForth Groovy Icon Io Lisaac Mercury Nice Oberon-2 OO2C Pike Prolog SWI Prolog YAP Rebol SML MLton SML SML/NJ Tcl Zonnon Mono

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 Zonnon Mono 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.

  :  

online book Practical Common Lisp

This is SBCL 1.0.15-gentoo, an implementation of ANSI Common Lisp.

Home Page: http://sbcl.sourceforge.net/

Download: http://sbcl.sourceforge.net/

  Home   Conclusions   License   Help