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 16, 2026 23:12Tomislav TunkovicTomislav TunkovicScore: 41,068Success
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 04:5240,86944,255,10634,837,0001,128,00045,056
2Aug 17, 2026 04:5240,93544,284,70334,929,0001,094,00045,056
3Aug 17, 2026 04:5240,97744,240,19934,917,0001,143,00045,056
4Aug 17, 2026 04:5241,05144,961,19334,983,0001,142,00045,056
5Aug 17, 2026 04:5241,06844,397,78535,048,0001,092,00045,056
6Aug 17, 2026 04:5241,09444,358,15535,026,0001,137,00045,056
7Aug 17, 2026 04:5241,11144,639,58335,026,0001,152,00045,056
8Aug 17, 2026 04:5241,12744,285,91535,051,0001,141,00045,056
9Aug 17, 2026 04:5241,19346,427,61535,095,0001,155,00045,056