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 29, 2026 16:49Victor MerckléVictor MerckléScore: 4,731Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 29, 2026 16:524,60611,873,5414,054,00002,113,536
2Jun 29, 2026 16:524,61211,780,8144,059,00002,113,536
3Jun 29, 2026 16:524,72012,142,2484,154,00002,113,536
4Jun 29, 2026 16:524,72512,092,0914,158,00002,113,536
5Jun 29, 2026 16:524,73111,824,7164,164,00002,113,536
6Jun 29, 2026 16:524,73111,814,6474,164,00002,113,536
7Jun 29, 2026 16:524,73512,158,9754,167,00002,113,536
8Jun 29, 2026 16:524,88612,275,4674,300,00002,113,536
9Jun 29, 2026 16:525,21712,272,3654,591,00002,113,536