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 listAug 31, 2026 01:21Tomislav TunkovicTomislav TunkovicScore: 2,697Success
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Sep 4, 2026 13:30Victor Mercklé10.00CustomSolution Held
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 31, 2026 01:312,68110,495,1322,360,000020,480
2Aug 31, 2026 01:312,68810,427,6822,366,000020,480
3Aug 31, 2026 01:312,68910,531,6562,367,000020,480
4Aug 31, 2026 01:312,69710,536,4322,374,000020,480
5Aug 31, 2026 01:312,69710,328,4372,374,000020,480
6Aug 31, 2026 01:312,70010,472,2752,376,000020,480
7Aug 31, 2026 01:312,70311,229,2592,379,000020,480
8Aug 31, 2026 01:312,72810,340,8872,401,000020,480
9Aug 31, 2026 01:312,73010,362,5722,403,000020,480