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 Pike 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 Pike 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 Pike 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 Pike program used compared to the fastest Zonnon Mono program.

Pike used what fraction? used how many times more?
Benchmark	Time	Memory	Code
nsieve	5×	6×	±
n-body	40×	1/2	±

Pike used what fraction? used how many times more?
Time-used	|-	|---	25%	median	75%	---|	-|
(CPU secs)	5×	5×	5×	23×	40×	40×	40×

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

 Step 3 : Are the Pike 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 Pike 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
nsieve
Pike	12.05		63,316	266
Zonnon Mono	2.32		9,744	368
n-body
Pike	1,396.01		3,416	1260
Zonnon Mono	34.61		5,168	1524
k-nucleotide
Pike	1.54		17,412	750
	No program
mandelbrot
Pike	0.39		3,352	402
	No program
partial-sums
	No program
Zonnon Mono	Failed
recursive
Pike	1.37		3,348	403
Zonnon Mono	Failed
fasta
Pike	7.88		3,364	971
	No program
reverse-complement
Pike	0.22		2,840	337
	No program
pidigits
Pike	0.31		3,412	389
	No program
regex-dna
Pike	1.41		5,156	472
	No program
binary-trees
Pike	3.42		4,352	520
	No program
spectral-norm
Pike	8.74		3,324	345
	No program
nsieve-bits
Pike	61.74		13,284	306
	No program

 Step 4 : Are there other Pike programs for these benchmarks?

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

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 Pike programs is fastest on a different OS/machine.

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

Remember - those are just the fastest Pike 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.

 Pike : explicitly-typed dynamic oo programming 

Pike v7.6 release 86

Home Page: http://pike.roxen.com/

Download: http://pike.roxen.com/download/

  Home   Conclusions   License   Help