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 02:25Victor MerckléVictor MerckléScore: 6,543Success
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 02:286,40513,113,5735,637,00002,113,536
2Jun 23, 2026 02:286,42713,169,1115,656,00002,113,536
3Jun 23, 2026 02:286,51313,254,0415,732,00002,113,536
4Jun 23, 2026 02:286,53113,315,8655,748,00002,113,536
5Jun 23, 2026 02:286,54313,173,9965,758,00002,113,536
6Jun 23, 2026 02:286,55513,211,1405,769,00002,113,536
7Jun 23, 2026 02:286,57513,226,4175,786,00002,113,536
8Jun 23, 2026 02:286,64713,322,5025,850,00002,113,536
9Jun 23, 2026 02:286,68113,354,0715,880,00002,113,536