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 listMay 3, 2026 20:58TudyMTudyMScore: 30,402Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 3, 2026 21:0130,30242,833,38725,589,0001,077,0002,322,432
2May 3, 2026 21:0130,34743,923,28825,628,0001,078,0002,338,816
3May 3, 2026 21:0130,36343,728,67925,642,0001,078,0002,338,816
4May 3, 2026 21:0130,38245,191,34425,657,0001,080,0002,338,816
5May 3, 2026 21:0130,40243,593,91725,672,0001,082,0002,330,624
6May 3, 2026 21:0130,42044,896,08825,698,0001,072,0002,330,624
7May 3, 2026 21:0130,43543,773,23525,704,0001,079,0002,330,624
8May 3, 2026 21:0130,45242,154,46025,741,0001,057,0002,342,912
9May 3, 2026 21:0130,53243,528,08325,798,0001,071,0002,334,720