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 listSep 2, 2026 01:00Victor MerckléVictor MerckléScore: 3,144Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 2, 2026 01:023,04810,906,3762,683,00002,117,632stderr
2Sep 2, 2026 01:023,05110,908,0272,685,00002,117,632stderr
3Sep 2, 2026 01:023,06210,997,2532,695,00002,117,632stderr
4Sep 2, 2026 01:023,13810,966,7642,762,00002,117,632stderr
5Sep 2, 2026 01:023,14411,545,3152,767,00002,117,632stderr
6Sep 2, 2026 01:023,14811,081,7912,771,00002,117,632stderr
7Sep 2, 2026 01:023,14810,961,5682,771,00002,117,632stderr
8Sep 2, 2026 01:023,14812,167,7332,771,00002,117,632stderr
9Sep 2, 2026 01:023,15510,933,5512,777,00002,117,632stderr