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 10:03Victor MerckléVictor MerckléScore: 5,506Success
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 10:065,40512,332,1024,757,00002,113,536
2Jun 23, 2026 10:065,47312,305,9154,817,00002,113,536
3Jun 23, 2026 10:065,48212,304,5304,825,00002,113,536
4Jun 23, 2026 10:065,49212,660,0344,833,00002,113,536
5Jun 23, 2026 10:065,50612,269,8534,846,00002,113,536
6Jun 23, 2026 10:065,52512,332,7604,862,00002,113,536
7Jun 23, 2026 10:065,56412,694,5104,897,00002,113,536
8Jun 23, 2026 10:065,57212,735,3544,904,00002,113,536
9Jun 23, 2026 10:065,57612,733,4264,907,00002,113,536