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 2, 2026 06:50Victor MerckléVictor MerckléScore: 4,654Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 2, 2026 06:534,52911,728,6143,986,00002,117,632stderr
2Jul 2, 2026 06:534,63911,796,5054,083,00002,117,632stderr
3Jul 2, 2026 06:534,63911,744,0544,083,00002,117,632stderr
4Jul 2, 2026 06:534,64711,746,1614,090,00002,117,632stderr
5Jul 2, 2026 06:534,65411,793,6014,096,00002,117,632stderr
6Jul 2, 2026 06:534,66811,891,0074,108,00002,117,632stderr
7Jul 2, 2026 06:534,67111,834,4064,111,00002,117,632stderr
8Jul 2, 2026 06:534,78211,908,3424,209,00002,117,632stderr
9Jul 2, 2026 06:534,78913,264,7144,215,00002,117,632stderr