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 6, 2026 03:41Victor MerckléVictor MerckléScore: 3,925Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2026 03:443,90711,228,5623,439,00002,117,632stderr
2Jul 6, 2026 03:443,91111,251,4633,442,00002,117,632stderr
3Jul 6, 2026 03:443,91211,325,7453,443,00002,117,632stderr
4Jul 6, 2026 03:443,92011,231,9283,450,00002,117,632stderr
5Jul 6, 2026 03:443,92511,420,3713,454,00002,117,632stderr
6Jul 6, 2026 03:443,92911,299,1033,458,00002,117,632stderr
7Jul 6, 2026 03:444,00411,623,6783,524,00002,117,632stderr
8Jul 6, 2026 03:444,02711,460,1333,544,00002,117,632stderr
9Jul 6, 2026 03:444,08411,404,4903,594,00002,117,632stderr