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 15:41Victor MerckléVictor MerckléScore: 4,720Success
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 15:444,59511,755,9484,044,00002,113,536
2Jun 29, 2026 15:444,70011,859,8154,136,00002,113,536
3Jun 29, 2026 15:444,70712,084,4164,143,00002,113,536
4Jun 29, 2026 15:444,71312,075,9714,148,00002,113,536
5Jun 29, 2026 15:444,72011,951,1984,154,00002,113,536
6Jun 29, 2026 15:444,73212,103,8444,165,00002,113,536
7Jun 29, 2026 15:444,76811,934,3924,196,00002,113,536
8Jun 29, 2026 15:444,78211,900,6404,209,00002,113,536
9Jun 29, 2026 15:444,78912,138,9734,215,00002,113,536