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:38Victor MerckléVictor MerckléScore: 3,896Success
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:433,84811,247,6273,387,00002,117,632stderr
2Jul 6, 2026 09:433,85411,255,7213,392,00002,117,632stderr
3Jul 6, 2026 09:433,86711,246,5813,403,00002,117,632stderr
4Jul 6, 2026 09:433,87612,886,7383,411,00002,117,632stderr
5Jul 6, 2026 09:433,89611,256,2193,429,00002,117,632stderr
6Jul 6, 2026 09:433,93111,207,7493,460,00002,117,632stderr
7Jul 6, 2026 09:433,94311,292,9733,470,00002,117,632stderr
8Jul 6, 2026 09:433,95411,237,6693,480,00002,117,632stderr
9Jul 6, 2026 09:434,00311,635,0173,523,00002,117,632stderr