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 13:42Victor MerckléVictor MerckléScore: 4,519Success
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 13:454,39611,752,8053,869,00002,117,632stderr
2Jul 5, 2026 13:454,39811,692,8813,871,00002,117,632stderr
3Jul 5, 2026 13:454,40111,686,7473,873,00002,117,632stderr
4Jul 5, 2026 13:454,51811,745,4723,976,00002,117,632stderr
5Jul 5, 2026 13:454,51911,815,2533,977,00002,117,632stderr
6Jul 5, 2026 13:454,52611,751,3873,983,00002,117,632stderr
7Jul 5, 2026 13:454,56411,780,8374,017,00002,117,632stderr
8Jul 5, 2026 13:454,57011,852,1094,022,00002,117,632stderr
9Jul 5, 2026 13:455,09712,291,7784,486,00002,117,632stderr