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 4, 2026 23:30Victor MerckléVictor MerckléScore: 4,409Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 4, 2026 23:334,40211,695,0043,874,00002,117,632stderr
2Jul 4, 2026 23:334,40311,687,7803,875,00002,117,632stderr
3Jul 4, 2026 23:334,40411,774,3253,876,00002,117,632stderr
4Jul 4, 2026 23:334,40511,736,7723,877,00002,117,632stderr
5Jul 4, 2026 23:334,40911,693,4663,880,00002,117,632stderr
6Jul 4, 2026 23:334,54411,759,1693,999,00002,117,632stderr
7Jul 4, 2026 23:334,55511,755,7444,009,00002,117,632stderr
8Jul 4, 2026 23:334,66911,912,1144,109,00002,117,632stderr
9Jul 4, 2026 23:334,87912,048,3474,294,00002,117,632stderr