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 07:48Victor MerckléVictor MerckléScore: 8,942Success
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 07:508,80515,182,9017,749,00002,113,536
2Jun 6, 2026 07:508,83815,246,8867,778,00002,113,536
3Jun 6, 2026 07:508,92015,242,9817,850,00002,113,536
4Jun 6, 2026 07:508,92815,319,5027,857,00002,113,536
5Jun 6, 2026 07:508,94215,309,3817,869,00002,113,536
6Jun 6, 2026 07:508,94715,284,8327,874,00002,113,536
7Jun 6, 2026 07:508,96215,587,5857,887,00002,113,536
8Jun 6, 2026 07:508,96215,641,9857,887,00002,113,536
9Jun 6, 2026 07:509,16915,719,2808,069,00002,113,536