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 08:27Victor MerckléVictor MerckléScore: 5,957Success
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 08:305,81712,591,8635,119,00002,113,536
2Jun 23, 2026 08:305,91012,984,5585,201,00002,113,536
3Jun 23, 2026 08:305,92713,026,8705,216,00002,113,536
4Jun 23, 2026 08:305,93412,955,5715,222,00002,113,536
5Jun 23, 2026 08:305,95713,059,0565,243,00002,113,536
6Jun 23, 2026 08:306,05312,778,9275,327,00002,113,536
7Jun 23, 2026 08:306,17013,128,0675,430,00002,113,536
8Jun 23, 2026 08:306,22113,035,2555,475,00002,113,536
9Jun 23, 2026 08:306,26313,662,0765,512,00002,113,536