Dave Plummer

So we have a project called GitHub Primes.

If you just search for GitHub Primes, you'll find it.

And it is a single set of prime number algorithms implemented in about 100 different languages.

So it's the exact same algorithm and we require that you follow certain rules to make it fair.

And then you express that algorithm in whatever language you choose to the best of your ability.

And we run a benchmark every night and we compile the results and find out which languages are fastest.

It's all these languages.

So they all get built into an individual Docker container, and then they all run.

Zig, I think right now.

Zig.

It does, it varies.

People will make an improvement to the C++ and it'll pass for a while and the Zig guys will get angry and come back and make it faster.

So what they're doing is they're solving the primes up to 100 million as many times per second as they can in a five second loop.

Yeah, on all cores.

No.

So you can do anything you want, but it has to be a prime sieve.

You're allowed to use one bit per integer at most, so you can't use a byte, which is cheaper and easier.

There are a number of rules like that that you have to allocate the memory within your timed loop.

And so we have a set of rules, and we have...

Some solutions that don't follow the rules, like the 6502, because you've only got 64K, you can't do 100 million civ.