Io ÷ Perl | Computer Language Benchmarks Game

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

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

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

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

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

Io used what fraction? used how many times more?
Benchmark	Time	Memory	Code	Reduced N
fasta	17×	2×	±
recursive	19×	5×	±
binary-trees	23×	2×	±
spectral-norm	33×	2×	±	500
sum-file	43×	2×	±
partial-sums	45×	2×	±
nsieve	46×	¹/₂	±
nsieve-bits	108×	2×	2×	9
reverse-complement	477×	¹/₂	±

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

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

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

Program Source Code	CPU secs	Memory KB	Code B
fasta
Io	15,740.40	3,516	688
Perl	950.04	1,872	934
recursive
Io	16,821.48	58,540	331
Perl	898.78	10,836	380
binary-trees
Io	5,445.61	109,996	400
Perl	239.36	47,936	541
spectral-norm N = 500 reduced workload
Io	1,119.10	3,524	371
Perl	34.19	1,548	334
sum-file
Io	789.77	3,496	104
Perl	18.17	1,468	84
partial-sums
Io	780.15	3,528	381
Perl	17.41	1,476	389
nsieve
Io	1,182.17	53,504	281
Perl	25.45	121,904	290
nsieve-bits N = 9 reduced workload
Io	2,603.10	4,124	380
Perl	24.21	2,132	253
reverse-complement
Io	947.78	15,936	369
Perl	1.99	38,360	298
fannkuch
Io	Failed
mandelbrot
Io	Failed
n-body
Io	Failed
chameneos-redux
	No program
k-nucleotide
	No program
pidigits
	No program
regex-dna
	No program

Io 20080117