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 5, 2026 06:08Victor MerckléVictor MerckléScore: 4,557Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 06:104,43611,707,3323,904,00002,117,632stderr
2Jul 5, 2026 06:104,43911,709,4243,907,00002,117,632stderr
3Jul 5, 2026 06:104,52812,131,4913,985,00002,117,632stderr
4Jul 5, 2026 06:104,55711,738,6184,011,00002,117,632stderr
5Jul 5, 2026 06:104,55711,784,9644,011,00002,117,632stderr
6Jul 5, 2026 06:104,57112,110,6604,023,00002,117,632stderr
7Jul 5, 2026 06:104,57511,864,3134,026,00002,117,632stderr
8Jul 5, 2026 06:104,57912,129,2864,030,00002,117,632stderr
9Jul 5, 2026 06:104,65011,884,3454,092,00002,117,632stderr