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 16:07Victor MerckléVictor MerckléScore: 4,475Success
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 16:114,35211,647,3013,830,00002,117,632stderr
2Jul 5, 2026 16:114,35611,705,4813,834,00002,117,632stderr
3Jul 5, 2026 16:114,36811,633,2243,844,00002,117,632stderr
4Jul 5, 2026 16:114,43111,775,7263,900,00002,117,632stderr
5Jul 5, 2026 16:114,47511,685,3813,938,00002,117,632stderr
6Jul 5, 2026 16:114,49211,702,9963,953,00002,117,632stderr
7Jul 5, 2026 16:114,49413,590,0763,955,00002,117,632stderr
8Jul 5, 2026 16:114,50112,089,7973,961,00002,117,632stderr
9Jul 5, 2026 16:114,70311,900,2404,139,00002,117,632stderr