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 11:28Victor MerckléVictor MerckléScore: 5,920Success
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 11:315,79812,629,7625,103,00002,113,536
2Jun 23, 2026 11:315,81212,584,9835,115,00002,113,536
3Jun 23, 2026 11:315,81512,647,9665,118,00002,113,536
4Jun 23, 2026 11:315,91212,654,2965,203,00002,113,536
5Jun 23, 2026 11:315,92012,675,2925,210,00002,113,536
6Jun 23, 2026 11:315,92212,630,7745,212,00002,113,536
7Jun 23, 2026 11:315,93013,027,5185,219,00002,113,536
8Jun 23, 2026 11:315,93012,740,7975,219,00002,113,536
9Jun 23, 2026 11:315,95512,642,3215,241,00002,113,536