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 19:24Victor MerckléVictor MerckléScore: 5,226Success
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 19:265,07911,976,7254,470,00002,113,536
2Jun 23, 2026 19:265,08711,966,5954,477,00002,113,536
3Jun 23, 2026 19:265,11012,059,0594,497,00002,113,536
4Jun 23, 2026 19:265,22012,405,8614,594,00002,113,536
5Jun 23, 2026 19:265,22612,015,9024,599,00002,113,536
6Jun 23, 2026 19:265,22712,124,9594,600,00002,113,536
7Jun 23, 2026 19:265,22812,412,2414,601,00002,113,536
8Jun 23, 2026 19:265,23012,048,2584,603,00002,113,536
9Jun 23, 2026 19:265,42312,549,4804,773,00002,113,536