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 18:38Victor MerckléVictor MerckléScore: 5,461Success
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 18:415,35012,171,2664,708,00002,113,536
2Jun 23, 2026 18:415,44812,246,2564,795,00002,113,536
3Jun 23, 2026 18:415,45512,834,6044,801,00002,113,536
4Jun 23, 2026 18:415,45612,226,2204,802,00002,113,536
5Jun 23, 2026 18:415,46112,836,3134,806,00002,113,536
6Jun 23, 2026 18:415,46712,263,4164,811,00002,113,536
7Jun 23, 2026 18:415,46812,242,5804,812,00002,113,536
8Jun 23, 2026 18:415,47612,551,5484,819,00002,113,536
9Jun 23, 2026 18:415,48512,226,3254,827,00002,113,536