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 29, 2026 13:15Victor MerckléVictor MerckléScore: 4,861Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 29, 2026 13:184,72811,952,5444,161,00002,113,536
2Jun 29, 2026 13:184,75411,966,6374,184,00002,113,536
3Jun 29, 2026 13:184,75711,961,5714,187,00002,113,536
4Jun 29, 2026 13:184,85212,000,7774,270,00002,113,536
5Jun 29, 2026 13:184,86111,994,4504,278,00002,113,536
6Jun 29, 2026 13:184,86412,048,4724,281,00002,113,536
7Jun 29, 2026 13:184,88112,044,1374,296,00002,113,536
8Jun 29, 2026 13:184,88512,327,8454,299,00002,113,536
9Jun 29, 2026 13:185,20112,628,8944,577,00002,113,536