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 03:23Victor MerckléVictor MerckléScore: 6,572Success
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 03:266,46413,215,4065,689,00002,113,536
2Jun 23, 2026 03:266,47013,215,0535,694,00002,113,536
3Jun 23, 2026 03:266,56513,537,1615,778,00002,113,536
4Jun 23, 2026 03:266,56713,413,2465,779,00002,113,536
5Jun 23, 2026 03:266,57213,261,9755,784,00002,113,536
6Jun 23, 2026 03:266,57213,552,7595,784,00002,113,536
7Jun 23, 2026 03:266,59313,564,7965,802,00002,113,536
8Jun 23, 2026 03:266,66713,409,8035,867,00002,113,536
9Jun 23, 2026 03:266,93513,548,5196,103,00002,113,536