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 listOct 9, 2026 23:36highload-churnerhighload-churnerScore: 6,438Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 10, 2026 01:206,40416,065,7625,636,000028,672
2Oct 10, 2026 01:206,41116,613,6445,642,000028,672
3Oct 10, 2026 01:206,41716,054,4335,647,000028,672
4Oct 10, 2026 01:206,42715,995,9725,656,000028,672
5Oct 10, 2026 01:206,43816,061,8575,666,000028,672
6Oct 10, 2026 01:206,46416,651,0015,689,000028,672
7Oct 10, 2026 01:206,48516,706,2255,707,000028,672
8Oct 10, 2026 01:206,65617,677,4894,552,0001,306,00028,672
9Oct 10, 2026 01:207,18416,626,6206,322,000024,576