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 21, 2026 12:28Victor MerckléVictor MerckléScore: 6,812Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 21, 2026 12:306,77613,533,5385,963,00002,113,536
2Jun 21, 2026 12:306,78213,467,1495,969,00002,113,536
3Jun 21, 2026 12:306,78413,464,3855,970,00002,113,536
4Jun 21, 2026 12:306,80713,485,1005,991,00002,113,536
5Jun 21, 2026 12:306,81213,539,3065,995,00002,113,536
6Jun 21, 2026 12:306,84413,521,0566,023,00002,113,536
7Jun 21, 2026 12:306,90413,855,3636,076,00002,113,536
8Jun 21, 2026 12:306,97513,617,0726,138,00002,113,536
9Jun 21, 2026 12:307,15313,801,8506,295,00002,113,536