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 04:10Victor MerckléVictor MerckléScore: 4,576Success
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 04:124,45311,760,7563,919,00002,117,632stderr
2Jul 5, 2026 04:124,55212,035,2814,006,00002,117,632stderr
3Jul 5, 2026 04:124,55511,732,3684,009,00002,117,632stderr
4Jul 5, 2026 04:124,56111,768,4614,014,00002,117,632stderr
5Jul 5, 2026 04:124,57612,278,3334,027,00002,117,632stderr
6Jul 5, 2026 04:124,59212,114,2874,041,00002,117,632stderr
7Jul 5, 2026 04:124,63612,247,7084,080,00002,117,632stderr
8Jul 5, 2026 04:124,98512,283,9554,387,00002,117,632stderr
9Jul 5, 2026 04:125,02912,281,6584,426,00002,117,632stderr