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 2, 2026 11:49Victor MerckléVictor MerckléScore: 4,711Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 2, 2026 11:524,62511,858,4834,070,00002,117,632stderr
2Jul 2, 2026 11:524,62811,846,0704,073,00002,117,632stderr
3Jul 2, 2026 11:524,64811,873,8164,091,00002,117,632stderr
4Jul 2, 2026 11:524,70511,818,2314,141,00002,117,632stderr
5Jul 2, 2026 11:524,71111,905,7134,146,00002,117,632stderr
6Jul 2, 2026 11:524,72811,840,9254,161,00002,117,632stderr
7Jul 2, 2026 11:524,73112,174,0234,164,00002,117,632stderr
8Jul 2, 2026 11:524,74311,825,9344,174,00002,117,632stderr
9Jul 2, 2026 11:524,89511,988,4684,308,00002,117,632stderr