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 16:35vahookvahookScore: 3,519Success
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 16:343,48117,407,1051,021,0002,042,0002,494,464
2Feb 5, 2026 16:343,48120,525,2091,021,0002,042,0002,498,560
3Feb 5, 2026 16:353,48218,043,4851,021,0002,043,0002,535,424
4Feb 5, 2026 16:343,48416,299,7161,022,0002,044,0002,494,464
5Feb 5, 2026 16:353,51922,290,7591,032,0002,065,0002,490,368
6Feb 5, 2026 16:353,55317,691,9681,042,0002,085,0002,277,376
7Feb 5, 2026 16:353,55618,658,7571,043,0002,086,0002,281,472
8Feb 5, 2026 16:353,57622,461,4771,049,0002,098,0002,498,560
9Feb 5, 2026 16:353,66917,266,6081,076,0002,153,0002,498,560