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 6, 2026 07:18Victor MerckléVictor MerckléScore: 9,062Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 6, 2026 07:209,01115,412,8407,930,00002,113,536
2Jun 6, 2026 07:209,02615,393,2607,943,00002,113,536
3Jun 6, 2026 07:209,03215,422,7997,949,00002,113,536
4Jun 6, 2026 07:209,03515,387,2697,951,00002,113,536
5Jun 6, 2026 07:209,06215,462,1437,975,00002,113,536
6Jun 6, 2026 07:209,08815,407,0137,998,00002,113,536
7Jun 6, 2026 07:209,11915,485,6058,025,00002,113,536
8Jun 6, 2026 07:209,13015,497,9498,035,00002,113,536
9Jun 6, 2026 07:209,28715,721,1048,173,00002,113,536