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 07:58Victor MerckléVictor MerckléScore: 3,918Success
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 08:003,85311,208,0183,391,00002,117,632stderr
2Jul 6, 2026 08:003,85711,260,1083,395,00002,117,632stderr
3Jul 6, 2026 08:003,87011,254,1173,406,00002,117,632stderr
4Jul 6, 2026 08:003,87811,270,3733,413,00002,117,632stderr
5Jul 6, 2026 08:003,91811,293,1573,448,00002,117,632stderr
6Jul 6, 2026 08:003,97011,624,6913,494,00002,117,632stderr
7Jul 6, 2026 08:003,98411,328,0953,506,00002,117,632stderr
8Jul 6, 2026 08:004,06411,459,8323,577,00002,117,632stderr
9Jul 6, 2026 08:004,15011,419,0793,652,00002,117,632stderr