x64 Ubuntu : Intel® Q6600® one core
Computer Language Benchmarks Game      [[ Play ]]

- all benchmarks - n-body fannkuch-redux meteor-contest fasta fasta-redux spectral-norm reverse-complement mandelbrot k-nucleotide regex-dna pidigits chameneos-redux thread-ring binary-trees-redux binary-trees - all languages - Ada 2005 GNAT ATS C gcc Clojure C# Mono C++ g++ Dart Erlang HiPE F# Mono Fortran Intel Go Haskell GHC Java 7 JavaScript V8 Lisp SBCL Lua OCaml Pascal Free Pascal Perl PHP Python 3 Racket Ruby 2.0 Ruby JRuby Scala Smalltalk VisualWorks

÷ Ada 2005 GNAT ATS C gcc Clojure C# Mono C++ g++ Dart Erlang HiPE F# Mono Fortran Intel Go Haskell GHC Java 7 JavaScript V8 Lisp SBCL Lua OCaml Pascal Free Pascal Perl PHP Python 3 Racket Ruby 2.0 Ruby JRuby Scala Smalltalk VisualWorks x86 one core x64 quad-core x86 quad-core x64 one core

 1 : Are the programs faster? At a glance.

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

These are not the only compilers and interpreters. These are not the only programs that could be written. These are not the only tasks that could be solved. These are just 10 tiny examples.

 2 : Are the programs faster? Approximately.

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

used what fraction? used how many times more?
Benchmark	Time	Memory	Code

used what fraction? used how many times more?
Time-used	|-	|---	25%	median	75%	---|	-|
(Elapsed secs)

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

 3 : Are the programs faster? Measurements.

These are not the only tasks that could be solved. These are just 10 tiny examples. These are not the only compilers and interpreters. These are not the only programs that could be written.

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

Program Source Code	CPU secs	Elapsed secs	Memory KB	Code B	≈ CPU Load
binary-trees
	No program
Smalltalk VisualWorks	0.24	1.19	37,000	722	5% 10% 13% 96%
regex-dna
	No program
Smalltalk VisualWorks	3.80	3.86	44,976	584	0% 0% 0% 100%
n-body
	No program
Smalltalk VisualWorks	2.07	2.11	42,856	1652	0% 0% 2% 98%
fannkuch-redux
	No program
Smalltalk VisualWorks	4.16	4.19	42,596	838	0% 1% 0% 99%
spectral-norm
	No program
Smalltalk VisualWorks	0.88	0.92	41,268	438	0% 2% 1% 96%
fasta
	No program
Smalltalk VisualWorks	0.61	0.65	41,260	1315	2% 0% 6% 94%
fasta-redux
	No program
Smalltalk VisualWorks	0.48	0.51	41,264	1772	0% 4% 0% 94%
pidigits
	No program
Smalltalk VisualWorks	0.53	0.57	42,584	652	0% 5% 3% 93%
k-nucleotide
	No program
Smalltalk VisualWorks	3.98	4.04	77,436	1153	0% 0% 0% 100%
reverse-complement
	No program
Smalltalk VisualWorks	0.45	0.50	43,912	754	6% 0% 2% 92%
mandelbrot
	No program
Smalltalk VisualWorks	2.40	2.44	42,608	467	2% 0% 0% 98%

 4 : Are there other programs for these benchmarks?

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

Ada 2005 GNAT ATS C gcc Clojure C# Mono C++ g++ Dart Erlang HiPE F# Mono Fortran Intel Go Haskell GHC Java 7 JavaScript V8 Lisp SBCL Lua OCaml Pascal Free Pascal Perl PHP Python 3 Racket Ruby 2.0 Ruby JRuby Scala Smalltalk VisualWorks

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

 5 : Are there other faster programs for these benchmarks?

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

n-body fannkuch-redux meteor-contest fasta fasta-redux spectral-norm reverse-complement mandelbrot k-nucleotide regex-dna pidigits chameneos-redux thread-ring binary-trees-redux binary-trees

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

  :  

clm - Clean make - version 2.4

Home Page: Clean

Download: Download Clean

We've made the Clean programs a little more obvious by providing these library functions:

import StdEnv, ArgEnv

                                             
// The first commandline arg (if it will convert to Int) otherwise 1

argi :: Int
argi = if (argAsInt <= 0) 1 argAsInt
   where
      argv = getCommandLine
      argAsInt = if (size argv == 2) (toInt argv.[1]) 1


// Round to n decimal places & convert to String 

toStringWith :: !.Int !.Real -> {#Char}     
toStringWith n a
   # z = 10.0 ^(~ (toReal n))   
   # x = (0.5 * z) + abs a
   # (s,exp) = ndigits x z (entier x) (nsign a) 0
   # (s,exp) = nzeros s exp True
   = s

   where
   nsign x = if (x<0.0) "-" ""
      
   ndigits x z i s exp
      | x<z = (s,exp)
      # x = (x - toReal i)*10.0
      = ndigits x (z*10.0) (entier x) 
         ((if (exp == -1)(s +++ ".") s) +++ toString i) (exp-1)

   nzeros s exp point
      | exp < ~n = (s,exp)
      | (exp == -1 && point) = nzeros (s +++ ".") exp False
      = nzeros (s +++ "0") (exp-1) point 

  Home   Conclusions   License   Play