New benchmark strategy: Loop indefinitely for a fixed amount of CPU time

primes-alt.java

@@ -86,7 +86,7 @@ class IntList {
 class PrimeNumbersBenchmarkApp {
 	public static void main(String[] args) {
 		IntList res;
-		for (int i = 1; i <= 10; ++i) {
+		while (true) {
 			res = (new PrimeNumbersGenerator()).get_primes7(10000000);
 			System.out.format("Found %d prime numbers.\n", res.size());
 		}

primes.cpp

@@ -59,7 +59,7 @@ void get_primes7(int n, vector<int> &res) {
 }
 
 int main() {
-	for (int i = 1; i <= 10; ++i) {
+	while (1) {
 		vector<int> res;
 		get_primes7(10000000, res);
 		printf("Found %d prime numbers.\n", (int)res.size());

primes.go

@@ -48,7 +48,7 @@ func getPrimes7(n int) []int {
 
 func main() {
 	var res []int
-	for i := 0; i < 10; i++ {
+	for {
 		res = getPrimes7(10000000)
 		fmt.Printf("Found %d prime numbers.\n", len(res))
 	}

primes.java

@@ -44,7 +44,7 @@ class PrimeNumbersGenerator {
 class PrimeNumbersBenchmarkApp {
 	public static void main(String[] args) {
 		ArrayList<Integer> res;
-		for (int i = 1; i <= 10; ++i) {
+		while (true) {
 			res = (new PrimeNumbersGenerator()).get_primes7(10000000);
 			System.out.format("Found %d prime numbers.\n", res.size());
 		}

primes.js

@@ -34,7 +34,7 @@ function get_primes7(n) {
 	return res;
 }
 
-for (var i = 0; i < 10; i++) {
+while (1) {
 	var res = get_primes7(10000000);
 	console.log("Found " + res.length + " prime numbers.");
 }

primes.php

@@ -32,7 +32,7 @@ function get_primes7($n) {
 }
 
 $res = array();
-for ($i = 1; $i <= 10; ++$i) {
+while (1) {
 	$res = get_primes7(10000000);
 	print "Found ".count($res)." prime numbers.\n";
 }

primes.pl

@@ -36,7 +36,7 @@ sub get_primes7($) {
 }
 
 my @res;
-for (1..10) {
+while (1) {
 	@res = get_primes7(10000000);
 	print "Found ".(scalar @res)." prime numbers.\n";
 }

primes.py

@@ -28,6 +28,6 @@ def get_primes7(n):
 		m = 2*i+3
 	return [2]+[x for x in s if x]
 
-for t in range(10):
+while True:
 	res = get_primes7(10000000)
 	print("Found {} prime numbers.".format(len(res)))

primes.rb

@@ -24,7 +24,7 @@ def get_primes7(n)
   [2] + s.compact
 end
 
-10.times do
+loop do
   res = get_primes7(10000000)
 	puts "Found #{res.length} prime numbers."
 end