TopK Sergey Svistunov

Find the sum of the 100 largest values in a stream of binary integers as fast as possible.

Input: 100 000 000 uint32 values in little-endian binary on STDIN (4 bytes each).

Output: The uint64 sum of the top 100 greatest values, printed as a decimal string.

Back to listOct 20, 2026 09:19e1011e1011Score: 98,248Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 20, 2026 09:2286,08642,893,46630,751,0001,101,0002,113,536
2Oct 20, 2026 09:2286,36242,841,62630,857,0001,097,0002,113,536
3Oct 20, 2026 09:2286,99443,127,89531,089,0001,099,0002,113,536
4Oct 20, 2026 09:2287,33243,180,70931,211,0001,102,0002,113,536
5Oct 20, 2026 09:2298,24847,335,82735,222,0001,130,0002,113,536
6Oct 20, 2026 09:2298,64847,388,20935,368,0001,132,0002,113,536
7Oct 20, 2026 09:2298,79147,956,97735,378,0001,175,0002,113,536
8Oct 20, 2026 09:2298,82948,027,28235,372,0001,195,0002,113,536
9Oct 20, 2026 09:2298,98347,869,47535,429,0001,195,0002,113,536