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 8, 2026 22:17Victor MerckléVictor MerckléScore: 3,611Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 8, 2026 22:203,58711,070,7083,157,00002,117,632stderr
2Jul 8, 2026 22:203,58711,082,5903,157,00002,117,632stderr
3Jul 8, 2026 22:203,59011,039,7923,160,00002,117,632stderr
4Jul 8, 2026 22:203,60311,067,9533,171,00002,117,632stderr
5Jul 8, 2026 22:203,61111,096,8303,178,00002,117,632stderr
6Jul 8, 2026 22:203,70411,072,0133,260,00002,117,632stderr
7Jul 8, 2026 22:203,71211,534,0353,267,00002,117,632stderr
8Jul 8, 2026 22:203,71811,089,9313,272,00002,117,632stderr
9Jul 8, 2026 22:203,72511,064,5793,278,00002,117,632stderr