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 23, 2025 06:21wainCGPwainCGPScore: 48,139Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 23, 2025 06:2147,71968,696,99638,994,0002,999,0002,469,888
2Feb 23, 2025 06:2147,79570,267,52136,052,0006,008,0002,289,664
3Feb 23, 2025 06:2147,81168,135,83238,067,0004,007,0002,433,024
4Feb 23, 2025 06:2147,98664,334,17838,207,0004,021,0002,306,048
5Feb 23, 2025 06:2148,13971,194,90339,337,0003,025,0002,519,040
6Feb 23, 2025 06:2148,20065,256,03238,377,0004,039,0002,289,664
7Feb 23, 2025 06:2148,24268,849,11037,399,0005,054,0002,498,560
8Feb 23, 2025 06:2148,75665,187,81237,916,0004,989,0002,322,432
9Feb 23, 2025 06:2149,35774,305,78638,384,0005,050,0002,502,656