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:35highload-churnerhighload-churnerScore: 6,179Success
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:166,13816,035,4855,402,000028,672
2Oct 10, 2026 01:166,14815,866,4125,411,000028,672
3Oct 10, 2026 01:166,17315,846,0275,433,000028,672
4Oct 10, 2026 01:166,17315,810,6615,433,000028,672
5Oct 10, 2026 01:166,17915,799,5595,438,000028,672
6Oct 10, 2026 01:166,18816,418,3405,446,000028,672
7Oct 10, 2026 01:166,19616,574,6675,453,000028,672
8Oct 10, 2026 01:166,20916,448,8195,464,000028,672
9Oct 10, 2026 01:166,21015,887,1135,465,000028,672