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 10:10Victor MerckléVictor MerckléScore: 3,952Success
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 10:173,83911,212,6803,379,00002,117,632stderr
2Jul 6, 2026 10:173,84011,198,5693,380,00002,117,632stderr
3Jul 6, 2026 10:173,84511,159,3573,384,00002,117,632stderr
4Jul 6, 2026 10:173,94511,350,8333,472,00002,117,632stderr
5Jul 6, 2026 10:173,95211,377,7653,478,00002,117,632stderr
6Jul 6, 2026 10:173,95311,273,7853,479,00002,117,632stderr
7Jul 6, 2026 10:173,97211,668,8643,496,00002,117,632stderr
8Jul 6, 2026 10:173,97311,591,0903,497,00002,117,632stderr
9Jul 6, 2026 10:173,99411,255,3953,515,00002,117,632stderr