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 6, 2026 09:28Victor MerckléVictor MerckléScore: 7,576Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 6, 2026 09:307,54714,062,8466,642,00002,113,536
2Jun 6, 2026 09:307,56914,062,6966,661,00002,113,536
3Jun 6, 2026 09:307,57214,129,8866,664,00002,113,536
4Jun 6, 2026 09:307,57614,069,4996,667,00002,113,536
5Jun 6, 2026 09:307,57614,094,7676,667,00002,113,536
6Jun 6, 2026 09:307,57714,135,1546,668,00002,113,536
7Jun 6, 2026 09:307,58014,103,3536,671,00002,113,536
8Jun 6, 2026 09:307,62614,202,0706,711,00002,113,536
9Jun 6, 2026 09:307,99214,400,1677,033,00002,113,536