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 listApr 20, 2026 19:32Pavel SkripkinPavel SkripkinScore: 784,171Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 20, 2026 19:33781,770714,491,812686,959,000999,0002,359,296
2Apr 20, 2026 19:33782,775715,428,656686,843,0001,999,0002,363,392
3Apr 20, 2026 19:33783,427715,497,581688,416,0001,000,0002,359,296
4Apr 20, 2026 19:33783,538705,367,262687,516,0001,998,0002,273,280
5Apr 20, 2026 19:33784,171710,539,795689,071,0001,000,0002,359,296
6Apr 20, 2026 19:33786,750719,145,584690,342,0001,998,0002,363,392
7Apr 20, 2026 19:33792,257718,477,643696,187,0001,000,0002,363,392
8Apr 20, 2026 19:33800,056722,502,098703,050,0001,000,0002,355,200
9Apr 20, 2026 19:33816,000741,231,930717,080,0001,000,0002,273,280