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 listJul 5, 2026 03:15Victor MerckléVictor MerckléScore: 4,550Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 03:184,41411,734,7033,885,00002,117,632stderr
2Jul 5, 2026 03:184,43611,751,2043,904,00002,117,632stderr
3Jul 5, 2026 03:184,51511,805,0013,974,00002,117,632stderr
4Jul 5, 2026 03:184,54211,770,1023,997,00002,117,632stderr
5Jul 5, 2026 03:184,55012,142,9584,004,00002,117,632stderr
6Jul 5, 2026 03:184,55111,788,7674,005,00002,117,632stderr
7Jul 5, 2026 03:184,56212,110,7684,015,00002,117,632stderr
8Jul 5, 2026 03:184,65311,930,0814,095,00002,117,632stderr
9Jul 5, 2026 03:185,14812,315,4614,531,00002,117,632stderr