Sum of prime numbers Andrey Tsvetkov

Compute the sum of all prime numbers in a stream of binary integers as fast as possible.

Input: 1 000 000 uint32 values in little-endian binary on STDIN (4 bytes each).

Output: The uint64 sum of all values that are prime, printed as a decimal string.

Back to listJun 23, 2026 09:52Victor MerckléVictor MerckléScore: 5,504Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 23, 2026 09:555,37612,209,7024,731,00002,113,536
2Jun 23, 2026 09:555,43512,276,0924,783,00002,113,536
3Jun 23, 2026 09:555,48712,271,5734,829,00002,113,536
4Jun 23, 2026 09:555,49312,629,0734,834,00002,113,536
5Jun 23, 2026 09:555,50412,525,5214,844,00002,113,536
6Jun 23, 2026 09:555,51112,334,1364,850,00002,113,536
7Jun 23, 2026 09:555,52012,296,6754,858,00002,113,536
8Jun 23, 2026 09:555,56912,352,2914,901,00002,113,536
9Jun 23, 2026 09:555,72912,857,2535,042,00002,113,536