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 7, 2026 05:52Victor MerckléVictor MerckléScore: 5,393Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 05:555,27312,638,7524,641,00002,125,824stderr
2Jul 7, 2026 05:555,29212,669,9744,657,00002,125,824stderr
3Jul 7, 2026 05:555,38612,668,9453,715,0001,025,0002,121,728stderr
4Jul 7, 2026 05:555,38912,854,9183,717,0001,026,0002,121,728stderr
5Jul 7, 2026 05:555,39312,661,3903,710,0001,036,0002,121,728stderr
6Jul 7, 2026 05:555,40514,720,5663,716,0001,041,0002,121,728stderr
7Jul 7, 2026 05:555,41113,163,8523,727,0001,035,0002,121,728stderr
8Jul 7, 2026 05:555,42512,506,7023,716,0001,058,0002,125,824stderr
9Jul 7, 2026 05:555,42612,784,3253,730,0001,045,0002,121,728stderr