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 listFeb 15, 2026 01:40olliecrowolliecrowScore: 17,900Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 15, 2026 01:4017,75344,505,91315,623,00002,473,984
2Feb 15, 2026 01:4017,80537,129,40915,668,00002,396,160
3Feb 15, 2026 01:4017,85346,367,32115,711,00002,478,080
4Feb 15, 2026 01:4017,88941,053,31415,742,00002,478,080
5Feb 15, 2026 01:4017,90044,645,27015,752,00002,473,984
6Feb 15, 2026 01:4017,90342,570,65115,755,00002,469,888
7Feb 15, 2026 01:4017,93640,219,70215,784,00002,473,984
8Feb 15, 2026 01:4018,07335,488,26915,904,00002,469,888
9Feb 15, 2026 01:4018,07543,515,12214,912,000994,0002,478,080