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 listFeb 15, 2026 00:29olliecrowolliecrowScore: 17,911Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 15, 2026 00:2917,81031,926,57515,673,00002,478,080
2Feb 15, 2026 00:2917,84746,705,40015,705,00002,453,504
3Feb 15, 2026 00:2917,85847,140,61015,715,00002,469,888
4Feb 15, 2026 00:2917,85934,428,22414,669,0001,047,0002,478,080
5Feb 15, 2026 00:2917,91146,708,60515,762,00002,424,832
6Feb 15, 2026 00:2917,92533,088,57115,774,00002,469,888
7Feb 15, 2026 00:2917,92544,474,29015,774,00002,482,176
8Feb 15, 2026 00:2918,07631,164,43415,907,00002,478,080
9Feb 15, 2026 00:2918,08341,199,58715,913,00002,478,080