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 08:58Victor MerckléVictor MerckléScore: 3,954Success
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:043,84411,223,7223,383,00002,117,632stderr
2Jul 6, 2026 09:043,84611,252,1783,385,00002,117,632stderr
3Jul 6, 2026 09:043,87211,284,4673,408,00002,117,632stderr
4Jul 6, 2026 09:043,89811,278,2823,431,00002,117,632stderr
5Jul 6, 2026 09:043,95411,250,7343,480,00002,117,632stderr
6Jul 6, 2026 09:043,95511,614,9243,481,00002,117,632stderr
7Jul 6, 2026 09:043,96811,319,7613,492,00002,117,632stderr
8Jul 6, 2026 09:043,98111,236,0873,504,00002,117,632stderr
9Jul 6, 2026 09:043,98512,632,2433,507,00002,117,632stderr