÷

 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
↓ recursive1/2021/6±
↓ n-body1/1011/3±
↓ fannkuch1/771/3
↓ nsieve-bits1/421/14±
↓ pidigits1/391/21/2
↓ spectral-norm1/101/3±
↓ partial-sums1/101/2±
↓ sum-file1/7±±
↓ nsieve1/6±
↓ k-nucleotide±±
↓ reverse-complement11×±

± 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
 recursive 
Haskell GHC5.883,104447  
PHP1,190.7919,264315  
 n-body 
Haskell GHC27.382,0121687  
PHP2,772.216,2681289  
 fannkuch 
Haskell GHC20.551,7721005  
PHP1,584.886,188484  
 nsieve-bits 
Haskell GHC3.903,692388  
PHP164.5052,904317  
 pidigits 
Haskell GHC11.053,244377  
PHP432.387,892736  
 spectral-norm 
Haskell GHC379.788,080396  
PHP3,698.2223,392315  
 partial-sums 
Haskell GHC2.233,148476  
PHP21.516,124367  
 sum-file 
Haskell GHC8.0023,000162  
PHP52.2218,020146  
 nsieve 
Haskell GHC7.4319,064381  
PHP42.0216,264221  
 k-nucleotide 
Haskell GHC149.5529,5321015  
PHP97.2626,588818  
 reverse-complement 
Haskell GHC41.45485,680488  
PHP3.7465,724508  
 chameneos-redux 
Haskell GHC10.133,084789  
No PHP
 fasta
Haskell GHCFailed
 mandelbrot
Haskell GHCFailed
 binary-trees
   No program
 regex-dna
   No program

 Haskell GHC : lazy pure functional programming 

The Glorious Glasgow Haskell Compilation System, version 6.6.1

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

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

Revised BSD license