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 05:08Victor MerckléVictor MerckléScore: 6,089Success
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 05:115,98112,735,9885,264,00002,113,536
2Jun 23, 2026 05:116,06112,856,7565,334,00002,113,536
3Jun 23, 2026 05:116,08513,132,5855,355,00002,113,536
4Jun 23, 2026 05:116,08713,184,0795,357,00002,113,536
5Jun 23, 2026 05:116,08912,817,7245,359,00002,113,536
6Jun 23, 2026 05:116,08913,111,5305,359,00002,113,536
7Jun 23, 2026 05:116,09213,124,2375,361,00002,113,536
8Jun 23, 2026 05:116,13612,831,4005,400,00002,113,536
9Jun 23, 2026 05:116,40413,448,5015,636,00002,113,536