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 21, 2026 12:33Victor MerckléVictor MerckléScore: 6,884Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 21, 2026 12:356,75313,449,2875,943,00002,113,536
2Jun 21, 2026 12:356,81413,506,5665,997,00002,113,536
3Jun 21, 2026 12:356,84613,541,5406,025,00002,113,536
4Jun 21, 2026 12:356,85113,518,3536,029,00002,113,536
5Jun 21, 2026 12:356,88413,485,3376,058,00002,113,536
6Jun 21, 2026 12:356,93713,513,4016,105,00002,113,536
7Jun 21, 2026 12:357,02713,636,8376,184,00002,113,536
8Jun 21, 2026 12:357,06713,743,0956,219,00002,113,536
9Jun 21, 2026 12:357,10213,752,4466,250,00002,113,536