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 listMay 18, 2026 06:25Victor MerckléVictor MerckléScore: 9,644Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 18, 2026 06:309,54316,428,2648,398,00002,113,536
2May 18, 2026 06:309,55016,009,3838,404,00002,113,536
3May 18, 2026 06:309,57316,053,3988,425,00002,113,536
4May 18, 2026 06:309,57620,366,1578,427,00002,113,536
5May 18, 2026 06:309,64418,182,3268,487,00002,113,536
6May 18, 2026 06:309,64816,930,8698,491,00002,113,536
7May 18, 2026 06:309,65917,019,0998,500,00002,113,536
8May 18, 2026 06:309,65917,269,9358,500,00002,113,536
9May 18, 2026 06:309,85719,218,0528,675,00002,113,536