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 14, 2026 19:26Tomislav TunkovicTomislav TunkovicScore: 4,402Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 14, 2026 19:454,31111,939,3653,794,00002,117,632
2Aug 14, 2026 19:454,31311,968,9073,796,00002,117,632
3Aug 14, 2026 19:454,31511,854,4373,798,00002,117,632
4Aug 14, 2026 19:454,39311,951,8843,866,00002,117,632
5Aug 14, 2026 19:454,40212,029,1723,874,00002,117,632
6Aug 14, 2026 19:454,41011,981,4283,881,00002,117,632
7Aug 14, 2026 19:454,41312,737,5113,884,00002,117,632
8Aug 14, 2026 19:454,43512,029,9083,903,00002,117,632
9Aug 14, 2026 19:454,51912,066,9233,977,00002,117,632