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 11, 2026 05:15Victor MerckléVictor MerckléScore: 7,819Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 11, 2026 05:177,76414,110,2946,833,00002,113,536
2Jun 11, 2026 05:177,76714,066,9856,835,00002,113,536
3Jun 11, 2026 05:177,77514,511,7556,842,00002,113,536
4Jun 11, 2026 05:177,78714,052,9126,853,00002,113,536
5Jun 11, 2026 05:177,81914,563,6406,881,00002,113,536
6Jun 11, 2026 05:177,82314,046,6756,885,00002,113,536
7Jun 11, 2026 05:177,82514,369,3546,886,00002,113,536
8Jun 11, 2026 05:177,83714,103,7256,897,00002,113,536
9Jun 11, 2026 05:177,96714,647,8937,011,00002,113,536