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 15, 2026 12:24Tomislav TunkovicTomislav TunkovicScore: 3,087Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 15, 2026 12:273,05510,832,8622,689,000020,480
2Aug 15, 2026 12:273,07210,849,5192,704,000020,480
3Aug 15, 2026 12:273,07210,807,7272,704,000020,480
4Aug 15, 2026 12:273,07910,904,6052,710,000020,480
5Aug 15, 2026 12:273,08711,025,4332,717,000020,480
6Aug 15, 2026 12:273,09510,878,0692,724,000020,480
7Aug 15, 2026 12:273,09610,657,3832,725,000020,480
8Aug 15, 2026 12:273,10510,904,4732,733,000020,480
9Aug 15, 2026 12:273,10910,877,8292,736,000020,480