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:08Victor MerckléVictor MerckléScore: 4,513Success
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:114,38511,837,4873,859,00002,117,632stderr
2Jul 4, 2026 23:114,49611,757,4473,957,00002,117,632stderr
3Jul 4, 2026 23:114,50311,785,6423,963,00002,117,632stderr
4Jul 4, 2026 23:114,50912,563,9443,968,00002,117,632stderr
5Jul 4, 2026 23:114,51311,965,7043,972,00002,117,632stderr
6Jul 4, 2026 23:114,52711,759,2653,984,00002,117,632stderr
7Jul 4, 2026 23:114,53511,854,4243,991,00002,117,632stderr
8Jul 4, 2026 23:114,53711,743,0173,993,00002,117,632stderr
9Jul 4, 2026 23:114,54512,161,0404,000,00002,117,632stderr