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 13, 2026 05:31Victor MerckléVictor MerckléScore: 7,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 13, 2026 05:397,72014,197,5726,794,00002,113,536
2Jun 13, 2026 05:397,72214,161,6436,796,00002,113,536
3Jun 13, 2026 05:397,79314,169,9616,858,00002,113,536
4Jun 13, 2026 05:397,80414,121,1736,868,00002,113,536
5Jun 13, 2026 05:397,81214,191,3846,875,00002,113,536
6Jun 13, 2026 05:397,82514,193,3416,886,00002,113,536
7Jun 13, 2026 05:397,83614,201,6496,896,00002,113,536
8Jun 13, 2026 05:397,85514,263,0986,913,00002,113,536
9Jun 13, 2026 05:397,89214,257,1796,945,00002,113,536