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 listMay 22, 2026 19:01M-RochatM-RochatScore: 22,845Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 22, 2026 19:0322,78230,148,25618,991,0001,058,0002,113,536
2May 22, 2026 19:0322,78531,566,48318,988,0001,063,0002,113,536
3May 22, 2026 19:0322,78629,739,37318,986,0001,066,0002,113,536
4May 22, 2026 19:0322,80230,393,14519,000,0001,066,0002,113,536
5May 22, 2026 19:0322,84531,095,40119,037,0001,067,0002,113,536
6May 22, 2026 19:0322,84729,779,54919,035,0001,071,0002,113,536
7May 22, 2026 19:0322,87729,796,76019,069,0001,063,0002,113,536
8May 22, 2026 19:0322,89330,368,51419,083,0001,063,0002,113,536
9May 22, 2026 19:0323,10130,086,64919,262,0001,067,0002,113,536