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 5, 2026 12:00Victor MerckléVictor MerckléScore: 9,517Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 5, 2026 12:039,48715,864,9718,349,00002,113,536
2Jun 5, 2026 12:039,49515,776,8078,356,00002,113,536
3Jun 5, 2026 12:039,50315,849,6618,363,00002,113,536
4Jun 5, 2026 12:039,51015,829,3538,369,00002,113,536
5Jun 5, 2026 12:039,51715,889,9438,375,00002,113,536
6Jun 5, 2026 12:039,52515,895,5658,382,00002,113,536
7Jun 5, 2026 12:039,61515,721,8198,462,00002,113,536
8Jun 5, 2026 12:039,62517,185,4818,470,00002,113,536
9Jun 5, 2026 12:039,66315,986,7548,504,00002,113,536