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:03highload-churnerhighload-churnerScore: 6,567Success
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 00:406,54416,756,3285,759,000028,672
2Oct 10, 2026 00:406,55516,152,6395,769,000028,672
3Oct 10, 2026 00:406,56216,283,8755,775,000028,672
4Oct 10, 2026 00:406,56416,782,4435,777,000028,672
5Oct 10, 2026 00:406,56716,799,7265,779,000028,672
6Oct 10, 2026 00:406,57016,802,8515,782,000028,672
7Oct 10, 2026 00:406,57516,755,0595,786,000028,672
8Oct 10, 2026 00:406,57916,212,0645,790,000028,672
9Oct 10, 2026 00:406,58016,179,3525,791,000028,672