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 16:04Victor MerckléVictor MerckléScore: 4,840Success
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 16:064,71411,980,7764,149,00002,117,632stderr
2Jul 4, 2026 16:064,71712,015,0464,151,00002,117,632stderr
3Jul 4, 2026 16:064,73611,957,0604,168,00002,117,632stderr
4Jul 4, 2026 16:064,83112,070,0894,252,00002,117,632stderr
5Jul 4, 2026 16:064,84012,061,4284,260,00002,117,632stderr
6Jul 4, 2026 16:064,84012,458,9254,260,00002,117,632stderr
7Jul 4, 2026 16:064,84212,107,5894,261,00002,117,632stderr
8Jul 4, 2026 16:064,85212,031,5964,270,00002,117,632stderr
9Jul 4, 2026 16:064,85512,394,1384,273,00002,117,632stderr