x64 Ubuntu : Intel® Q6600® quad-core
Computer Language Benchmarks Game      Help

- all benchmarks - binary-trees chameneos-redux fannkuch fasta k-nucleotide mandelbrot meteor-contest n-body pidigits regex-dna reverse-complement spectral-norm thread-ring - all languages - Ada 2005 GNAT ATS C GNU gcc C# Mono C++ GNU g++ Clean Erlang HiPE F# Mono Fortran Intel Go 6g 8g Haskell GHC Java 6 -server Java 6 -Xint Java 6 steady state JavaScript TraceMonkey JavaScript V8 Lisp SBCL Lua OCaml Pascal Free Pascal Perl PHP Python CPython Ruby JRuby Ruby MRI Scala Scheme PLT Smalltalk VisualWorks

 How big is the measured performance difference?

Each chart bar shows how many times more Time or how many times more Memory one unidentified ↓ regex-dna program used, compared to the program that used least Time or the program that used least Memory.

 regex-dna benchmark ~50MB N=5,000,000

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

Compare how much Memory the regex-dna programs used - sort Memory KB. Compare how much Code the programs used - sort Code B

Column × shows how many times more each program used compared to the program that used least.

		sort	sort	sort	sort
×	Program Source Code	CPU secs	Elapsed secs	Memory KB	Code B	~ CPU Load
1.0	C++ GNU g++ #4	12.64	4.15	97,532	1759	79% 71% 89% 65%
1.2	C++ GNU g++	18.37	5.04	97,464	1588	87% 96% 90% 91%
1.3	JavaScript V8 #2	5.32	5.31	215,404	373	100% 0% 0% 0%
2.0	C GNU gcc #4	24.67	8.21	111,020	1525	71% 65% 99% 65%
2.6	JavaScript TraceMonkey	10.79	10.80	636,800	365	0% 100% 0% 0%
2.6	Java 6 -server #5	26.67	10.91	681,824	929	57% 68% 63% 55%
2.7	OCaml	19.83	11.29	389,532	1261	25% 86% 25% 40%
2.7	OCaml #3	19.84	11.36	389,536	892	38% 85% 26% 26%
2.8	JavaScript TraceMonkey #2	11.79	11.79	558,544	373	100% 0% 0% 0%
3.1	Perl #2	38.61	12.84	167,208	527	78% 66% 76% 81%
3.1	Haskell GHC #4	36.44	12.93	188,336	1672	58% 88% 66% 63%
3.2	Scala #3	30.62	13.47	747,292	659	71% 63% 47% 44%
3.3	Java 6 -server #2	39.97	13.63	850,180	1534	66% 73% 83% 70%
4.0	Ada 2005 GNAT	45.99	16.50	183,732	3334	79% 68% 61% 66%
4.9	Lisp SBCL #3	44.58	20.28	787,404	1948	51% 42% 75% 50%
4.9	OCaml #2	20.29	20.29	389,564	615	100% 0% 0% 0%
5.9	C++ GNU g++ #3	24.49	24.49	126,412	1599	0% 0% 0% 100%
6.2	Java 6 -server #4	26.17	25.70	874,580	921	41% 2% 57% 1%
6.3	Scala #2	54.52	26.26	1,031,012	1520	39% 77% 44% 47%
6.5	Python CPython	26.85	26.85	203,644	342	100% 0% 0% 0%
7.5	C GNU gcc #2	31.06	31.06	124,780	1099	100% 0% 0% 0%
7.6	ATS	31.70	31.70	172,412	2551	0% 0% 100% 0%
7.9	Scheme PLT	32.93	32.93	597,148	835	0% 0% 0% 100%
8.0	Scheme PLT #2	33.21	33.21	625,652	669	0% 0% 0% 100%
8.5	C# Mono #6	89.60	35.19	586,488	638	53% 77% 69% 55%
12	PHP #2	48.44	48.44	206,796	449	0% 100% 0% 0%
12	Perl #4	49.07	49.07	891,364	440	0% 0% 0% 99%
12	Ruby MRI	50.21	50.21	350,236	323	0% 100% 0% 0%
12	C# Mono #5	158.57	51.88	551,648	1647	86% 77% 73% 67%
16	Erlang HiPE #6	206.21	65.25	190,068	1058	64% 61% 88% 97%
19	Ruby JRuby	81.01	77.02	551,716	323	4% 8% 92% 3%
19	Erlang HiPE #5	216.35	79.01	1,550,336	855	51% 63% 65% 92%
20	C# Mono	84.28	84.26	2,657,964	624	0% 100% 0% 0%
20	C# Mono #3	84.30	84.29	2,617,220	607	100% 0% 0% 0%
31	Erlang HiPE	5 min	127.55	1,644,348	1022	56% 48% 94% 46%
35	Java 6 -Xint #5	5 min	143.55	678,096	929	84% 73% 64% 66%
38	C# Mono #2	156.01	155.99	2,686,112	645	0% 0% 0% 100%
48	Java 6 -Xint #2	9 min	197.25	686,288	1534	70% 66% 86% 72%
83	Java 6 -Xint #4	5 min	5 min	628,848	921	0% 0% 0% 100%
85	Smalltalk VisualWorks	5 min	5 min	299,340	584	0% 0% 100% 0%
94	Erlang HiPE #3	6 min	6 min	2,442,316	687	96% 4% 1% 0%
101	Go 6g 8g	6 min	6 min	635,908	634	0% 0% 0% 100%
	Ada 2005 GNAT #3	Failed			1233
	Ada 2005 GNAT #4	Failed			1352
	Erlang HiPE #2	Failed			808
	JavaScript V8	Bad Output			365
	Lisp SBCL	Failed			591
	Scala	Failed			663
interesting alternative programs
	Fortran Intel	Failed			2425
1.2	Perl #6	4.78	4.78	190,988	477
1.2	Perl #3	4.96	4.95	288,312	440
2.7	Perl #5	11.24	11.24	190,956	484
2.9	Python CPython #2	11.93	11.93	213,144	314
3.1	Haskell GHC	38.78	13.07	458,300	519
3.5	Pascal Free Pascal #3	14.68	14.68	220,268	2932
4.6	Perl	19.17	19.17	189,408	426
4.8	PHP	49.49	19.98	227,644	1044
5.2	F# Mono	30.56	21.74	642,148	796
5.7	Pascal Free Pascal	23.82	23.82	117,888	1199
9.0	Lua #3	37.32	37.32	360,344	427
9.6	Ruby MRI #2	40.00	40.00	424,724	396
15	Ruby JRuby #2	64.53	60.87	510,264	396
17	C# Mono #4	70.18	70.19	439,980	657
missing programs
	Clean	No program
	F# Mono	No program
	Fortran Intel	No program
	Java 6 steady state	No program
	Lua	No program
	Pascal Free Pascal	No program

 regex-dna benchmark : Match DNA 8-mers and substitute nucleotides for IUB codes

diff program output for this 100KB input file (generated with the fasta program N = 10000) with this output file to check your program is correct before contributing.

We use FASTA files generated by the fasta benchmark as input for this benchmark. Note: the file may include both lowercase and uppercase codes.

Each program should

• read all of a redirected FASTA format file from stdin, and record the sequence length
• use the same simple regex pattern match-replace to remove FASTA sequence descriptions and all linefeed characters, and record the sequence length
• use the same simple regex patterns, representing DNA 8-mers and their reverse complement (with a wildcard in one position), and (one pattern at a time) count matches in the redirected file
• write the regex pattern and count
• use the same simple regex patterns to make IUB code alternatives explicit, and (one pattern at a time) match-replace the pattern in the redirect file, and record the sequence length
• write the 3 recorded sequence lengths