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 listJun 23, 2026 16:06Victor MerckléVictor MerckléScore: 5,972Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 23, 2026 16:095,85012,710,5565,148,00002,117,632stderr
2Jun 23, 2026 16:095,89212,736,0625,185,00002,117,632stderr
3Jun 23, 2026 16:095,96312,824,7645,248,00002,117,632stderr
4Jun 23, 2026 16:095,96312,779,5685,248,00002,117,632stderr
5Jun 23, 2026 16:095,97213,062,6595,256,00002,117,632stderr
6Jun 23, 2026 16:095,97312,747,0055,257,00002,117,632stderr
7Jun 23, 2026 16:095,98913,109,7845,271,00002,117,632stderr
8Jun 23, 2026 16:095,99212,810,3435,273,00002,117,632stderr
9Jun 23, 2026 16:096,13512,915,1505,399,00002,117,632stderr