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 17, 2026 11:01Tomislav TunkovicTomislav TunkovicScore: 5,659Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 17, 2026 11:105,62514,678,5163,807,0001,143,00040,960
2Aug 17, 2026 11:105,63514,702,9833,812,0001,147,00040,960
3Aug 17, 2026 11:105,64014,419,5413,763,0001,201,00040,960
4Aug 17, 2026 11:105,64717,977,2754,970,000081,920
5Aug 17, 2026 11:105,65914,726,6453,830,0001,150,00040,960
6Aug 17, 2026 11:105,66414,392,9933,585,0001,400,00040,960
7Aug 17, 2026 11:105,67614,395,0323,833,0001,162,00040,960
8Aug 17, 2026 11:105,91016,382,6134,061,0001,140,00040,960
9Aug 17, 2026 11:106,67715,307,6964,711,0001,165,00040,960