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 2, 2026 05:36Victor MerckléVictor MerckléScore: 4,607Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 2, 2026 05:394,56211,843,8504,015,00002,117,632stderr
2Jul 2, 2026 05:394,58911,786,4574,039,00002,117,632stderr
3Jul 2, 2026 05:394,59311,853,7724,042,00002,117,632stderr
4Jul 2, 2026 05:394,59411,791,2544,043,00002,117,632stderr
5Jul 2, 2026 05:394,60711,834,6004,055,00002,117,632stderr
6Jul 2, 2026 05:394,71511,816,2464,150,00002,117,632stderr
7Jul 2, 2026 05:394,75311,910,0604,183,00002,117,632stderr
8Jul 2, 2026 05:394,83811,964,8454,258,00002,117,632stderr
9Jul 2, 2026 05:395,19712,266,3594,574,00002,117,632stderr