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 5, 2026 02:09vahookvahookScore: 3,559Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 5, 2026 02:073,46521,749,1631,016,0002,033,0002,494,464
2Feb 5, 2026 02:073,49818,393,0491,026,0002,052,0002,494,464
3Feb 5, 2026 02:073,55717,373,7501,043,0002,087,0002,277,376
4Feb 5, 2026 02:093,55721,264,2941,043,0002,087,0002,498,560
5Feb 5, 2026 02:073,55919,297,3702,088,0001,044,0002,494,464
6Feb 5, 2026 02:073,56419,114,8071,045,0002,091,0002,498,560
7Feb 5, 2026 02:093,56418,213,3521,045,0002,091,0002,490,368
8Feb 5, 2026 02:093,59719,308,8461,055,0002,110,0002,494,464
9Feb 5, 2026 02:073,60316,121,5721,057,0002,114,0002,490,368