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 18:43Tomislav TunkovicTomislav TunkovicScore: 2,762Success
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 18:472,74510,568,4942,416,000020,480
2Aug 15, 2026 18:472,75410,585,3202,424,000020,480
3Aug 15, 2026 18:472,75510,577,8772,425,000020,480
4Aug 15, 2026 18:472,75610,590,3202,426,000020,480
5Aug 15, 2026 18:472,76210,605,0242,431,000020,480
6Aug 15, 2026 18:472,76410,549,7252,433,000020,480
7Aug 15, 2026 18:472,77310,601,9272,441,000020,480
8Aug 15, 2026 18:472,77710,524,5002,444,000020,480
9Aug 15, 2026 18:472,78710,632,3792,453,000020,480