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 4, 2026 10:30Victor MerckléVictor MerckléScore: 4,602Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 4, 2026 10:344,46811,764,3473,932,00002,117,632stderr
2Jul 4, 2026 10:344,47911,736,3073,942,00002,117,632stderr
3Jul 4, 2026 10:344,58811,879,4234,038,00002,117,632stderr
4Jul 4, 2026 10:344,59311,751,7294,042,00002,117,632stderr
5Jul 4, 2026 10:344,60211,834,5694,050,00002,117,632stderr
6Jul 4, 2026 10:344,60712,173,5644,055,00002,117,632stderr
7Jul 4, 2026 10:344,63211,860,0134,077,00002,117,632stderr
8Jul 4, 2026 10:344,63211,797,8754,077,00002,117,632stderr
9Jul 4, 2026 10:344,65911,933,4244,100,00002,117,632stderr