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 18:23Victor MerckléVictor MerckléScore: 5,201Success
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 18:265,07011,958,2314,462,00002,113,536
2Jun 23, 2026 18:265,15912,084,0214,540,00002,113,536
3Jun 23, 2026 18:265,18011,909,6234,559,00002,113,536
4Jun 23, 2026 18:265,18711,969,9694,565,00002,113,536
5Jun 23, 2026 18:265,20112,056,8544,577,00002,113,536
6Jun 23, 2026 18:265,20412,359,0874,580,00002,113,536
7Jun 23, 2026 18:265,21112,021,4964,586,00002,113,536
8Jun 23, 2026 18:265,21412,338,7894,589,00002,113,536
9Jun 23, 2026 18:265,24812,379,9414,619,00002,113,536