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 13:38Victor MerckléVictor MerckléScore: 4,843Success
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 13:414,66211,917,1144,103,00002,113,536
2Jun 29, 2026 13:414,69311,905,9754,130,00002,113,536
3Jun 29, 2026 13:414,70511,889,6774,141,00002,113,536
4Jun 29, 2026 13:414,72711,914,1314,160,00002,113,536
5Jun 29, 2026 13:414,84311,929,4744,262,00002,113,536
6Jun 29, 2026 13:414,84711,939,9314,266,00002,113,536
7Jun 29, 2026 13:414,85511,923,2074,273,00002,113,536
8Jun 29, 2026 13:414,86011,976,3014,277,00002,113,536
9Jun 29, 2026 13:415,19312,192,0854,570,00002,113,536