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 10:22Victor MerckléVictor MerckléScore: 5,468Success
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 10:245,35012,262,0154,708,00002,113,536
2Jun 23, 2026 10:245,36712,254,2774,723,00002,113,536
3Jun 23, 2026 10:245,44712,266,6934,794,00002,113,536
4Jun 23, 2026 10:245,45512,599,8194,801,00002,113,536
5Jun 23, 2026 10:245,46812,595,6514,812,00002,113,536
6Jun 23, 2026 10:245,47612,330,2014,819,00002,113,536
7Jun 23, 2026 10:245,49512,324,0444,836,00002,113,536
8Jun 23, 2026 10:245,64312,760,2214,966,00002,113,536
9Jun 23, 2026 10:245,69812,464,2475,015,00002,113,536