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 22, 2025 14:27wainCGPwainCGPScore: 59,242Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 22, 2025 14:2758,99283,175,10348,918,0002,995,0002,371,584
2Feb 22, 2025 14:2759,11374,418,72848,018,0004,001,0002,281,472
3Feb 22, 2025 14:2759,14373,733,21347,042,0005,004,0002,441,216
4Feb 22, 2025 14:2759,20973,958,92846,092,0006,012,0002,465,792
5Feb 22, 2025 14:2759,24280,381,39047,121,0005,012,0002,473,984
6Feb 22, 2025 14:2759,53481,438,58746,345,0006,045,0002,310,144
7Feb 22, 2025 14:2759,53673,825,84347,355,0005,037,0002,494,464
8Feb 22, 2025 14:2759,73677,458,62747,514,0005,054,0002,486,272
9Feb 22, 2025 14:2763,02680,042,72050,421,0005,042,0002,355,200