÷

 Are the Haskell GHC programs faster?

Do the Haskell GHC programs use optimized assembly code libraries? Are they small simple programs or very optimized programs? Do the Haskell GHC programs use a fraction of the time used by other programs or do they use several times more?


 Haskell GHC used what fraction? used how many times more? 
Programs Time Memory Code Reduced N
↓ fannkuch1/31±
↓ spectral-norm1/29±
↓ nsieve-bits1/241/2±
↓ mandelbrot1/16
↓ pidigits1/151/3
↓ recursive1/141/2±
↓ n-body1/12±
↓ reverse-complement1/7±
↓ nsieve1/51/16
↓ sum-file1/5
↓ fasta1/3±
↓ partial-sums1/2±±
↓ k-nucleotide±

± look at the measurements and then look at the programs.

 Are the Haskell GHC programs faster?

Program & Logs CPU secs Elapsed secs Memory KB Code B ~ CPU Load
 fannkuch 
Haskell GHC16.579921005  
Lua508.06864469  
 spectral-norm 
Haskell GHC24.82964737  
Lua727.881,100328  
 nsieve-bits 
Haskell GHC4.123,728388  
Lua99.677,120426  
 mandelbrot 
Haskell GHC5.321,332627  
Lua83.21864367  
 pidigits 
Haskell GHC2.862,488377  
Lua41.431,1481005  
 recursive 
Haskell GHC8.051,464447  
Lua114.382,280330  
 n-body 
Haskell GHC48.721,6481687  
Lua586.858721265  
 reverse-complement 
Haskell GHC1.2764,192915  
Lua8.8543,000538  
 nsieve 
Haskell GHC2.126,060396  
Lua10.9399,276258  
 sum-file 
Haskell GHC4.562,816162  
Lua21.8484082  
 fasta 
Haskell GHC62.221,6841096  
Lua213.66904993  
 partial-sums 
Haskell GHC4.36864476  
Lua7.45900437  
 k-nucleotide 
Haskell GHC28.56164,7121767  
Lua35.4338,248613  
 binary-trees 
Haskell GHC3.359,152512  
No Lua
 chameneos-redux 
Haskell GHC11.931,528789  
No Lua
 regex-dna
   No program

 Haskell GHC : lazy pure functional programming 

Glasgow Haskell Compiler, Version 6.8.2, for Haskell 98, stage 2 booted by GHC version 6.8.2

Home Page: http://www.haskell.org/

Download: http://www.haskell.org/ghc/

Revised BSD license