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 5, 2026 10:10Victor MerckléVictor MerckléScore: 4,922Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 10:134,84612,147,3974,265,00002,117,632stderr
2Jul 5, 2026 10:134,90912,168,0084,320,00002,117,632stderr
3Jul 5, 2026 10:134,91812,126,4704,328,00002,117,632stderr
4Jul 5, 2026 10:134,92112,173,9224,331,00002,117,632stderr
5Jul 5, 2026 10:134,92212,174,6944,332,00002,117,632stderr
6Jul 5, 2026 10:135,02912,918,5814,426,00002,117,632stderr
7Jul 5, 2026 10:135,03412,163,7174,430,00002,117,632stderr
8Jul 5, 2026 10:135,05312,224,9534,447,00002,117,632stderr
9Jul 5, 2026 10:135,33412,882,6684,694,00002,117,632stderr