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:14vahookvahookScore: 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 02:163,46022,732,4711,015,0002,030,0002,281,472
2Feb 5, 2026 02:113,48115,504,0071,021,0002,042,0002,494,464
3Feb 5, 2026 02:143,48223,897,9871,021,0002,043,0002,277,376
4Feb 5, 2026 02:113,48419,521,5241,022,0002,044,0002,494,464
5Feb 5, 2026 02:163,51918,258,2911,032,0002,065,0002,498,560
6Feb 5, 2026 02:163,52321,731,8561,033,0002,067,0002,281,472
7Feb 5, 2026 02:143,52618,973,3801,034,0002,069,0002,498,560
8Feb 5, 2026 02:143,52820,467,7531,035,0002,070,0002,498,560
9Feb 5, 2026 02:113,53217,004,7121,036,0002,072,0002,281,472