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 6, 2026 09:11Victor MerckléVictor MerckléScore: 3,928Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2026 09:163,84011,267,1363,380,00002,117,632stderr
2Jul 6, 2026 09:163,84311,194,9203,382,00002,117,632stderr
3Jul 6, 2026 09:163,84811,246,1063,387,00002,117,632stderr
4Jul 6, 2026 09:163,92511,162,9813,454,00002,117,632stderr
5Jul 6, 2026 09:163,92811,259,3533,457,00002,117,632stderr
6Jul 6, 2026 09:163,93611,212,9673,464,00002,117,632stderr
7Jul 6, 2026 09:163,94511,289,5013,472,00002,117,632stderr
8Jul 6, 2026 09:163,94611,349,1763,473,00002,117,632stderr
9Jul 6, 2026 09:163,96311,456,9623,488,00002,117,632stderr