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 3, 2026 02:21Victor MerckléVictor MerckléScore: 4,481Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 3, 2026 02:244,37011,574,8993,846,00002,117,632stderr
2Jul 3, 2026 02:244,37711,621,7803,852,00002,117,632stderr
3Jul 3, 2026 02:244,38011,593,4733,855,00002,117,632stderr
4Jul 3, 2026 02:244,38811,640,7053,862,00002,117,632stderr
5Jul 3, 2026 02:244,48111,596,8173,944,00002,117,632stderr
6Jul 3, 2026 02:244,49211,996,8373,953,00002,117,632stderr
7Jul 3, 2026 02:244,55311,739,0324,007,00002,117,632stderr
8Jul 3, 2026 02:244,64211,803,4054,085,00002,117,632stderr
9Jul 3, 2026 02:244,83511,960,4224,255,00002,117,632stderr