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 CINT 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

 performance measurements

Each table row shows performance measurements for this JavaScript V8 program with a particular command-line input value N.

N	CPU secs	Elapsed secs	Memory KB	Code B	≈ CPU Load
250,000	211.11	211.20	29,464	423	0% 0% 0% 100%
2,500,000	Timed Out			423

Read the ↓ make, command line, and program output logs to see how this program was run.

Read k-nucleotide benchmark to see what this program should do.

 notes

V8 version 3.18.5.2 [console: dumb]

 k-nucleotide JavaScript V8 program source code

/* The Computer Language Benchmarks Game
   http://benchmarksgame.alioth.debian.org/

   Contributed by Jesse Millikan    
*/

// Return hash t with frequency in "n"
function frequency(seq, length){
 var m, i, t = {}, n = seq.length - length + 1

 for(i = 0; i < n; i++){
  m = seq.substr(i, length)
  t[m] = (t[m] || 0) + 1
 }

 t.n = n
 return t
}

function sort(seq, length){
 var f = frequency(seq, length), keys = [], k, i
 
 // Put all keys in key array in reverse
 for(k in f)
  if(k != 'n') keys.unshift(k)

 keys.sort(function(a, b){ return f[b] - f[a] })

 for(i in keys)
  print(keys[i].toUpperCase(), (f[keys[i]] * 100 / f.n).toFixed(3))

 print()
}

function find(seq, s){
 var f = frequency(seq, s.length)
 print((f[s] || 0) + "\t" + s.toUpperCase())
}

var seq="", l, others = ["ggt", "ggta", "ggtatt", "ggtattttaatt", "ggtattttaatttatagt"]

while(!readline().match(/^>THREE/)); // no body

while((l = readline()) && !l.match(/^>/))
 seq += l

sort(seq, 1)
sort(seq, 2)

for(i in others)
 find(seq, others[i])

 make, command-line, and program output logs

Sat, 04 May 2013 16:19:49 GMT

COMMAND LINE:
/usr/local/src/v8/out/native/d8 --nodebugger knucleotide.v8 -- 0 < knucleotide-input2500000.txt

TIMED OUT after 3600s


PROGRAM OUTPUT:

  Home   Conclusions   License   Play