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:17Victor MerckléVictor MerckléScore: 3,935Success
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 08:213,85011,221,0133,388,00002,117,632stderr
2Jul 6, 2026 08:213,85111,249,9323,389,00002,117,632stderr
3Jul 6, 2026 08:213,86211,225,0363,399,00002,117,632stderr
4Jul 6, 2026 08:213,86811,230,8433,404,00002,117,632stderr
5Jul 6, 2026 08:213,93511,199,9483,463,00002,117,632stderr
6Jul 6, 2026 08:213,94511,361,9733,472,00002,117,632stderr
7Jul 6, 2026 08:213,97811,611,1553,501,00002,117,632stderr
8Jul 6, 2026 08:214,12311,418,3623,629,00002,117,632stderr
9Jul 6, 2026 08:214,14611,405,0123,649,00002,117,632stderr