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 04:26Victor MerckléVictor MerckléScore: 6,094Success
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 04:295,97312,814,5445,257,00002,113,536
2Jun 23, 2026 04:296,08613,152,2425,356,00002,113,536
3Jun 23, 2026 04:296,09312,987,1155,362,00002,113,536
4Jun 23, 2026 04:296,09412,948,4975,363,00002,113,536
5Jun 23, 2026 04:296,09412,819,1915,363,00002,113,536
6Jun 23, 2026 04:296,09412,791,9795,363,00002,113,536
7Jun 23, 2026 04:296,10412,755,4805,372,00002,113,536
8Jun 23, 2026 04:296,16512,835,1125,426,00002,113,536
9Jun 23, 2026 04:296,24312,994,2935,494,00002,113,536