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 00:54e1011e1011Score: 128,694Success
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 00:55128,09758,372,28146,277,0001,119,0002,113,536
2Oct 20, 2026 00:55128,55458,407,62346,464,0001,101,0002,113,536
3Oct 20, 2026 00:55128,63258,567,35346,493,0001,101,0002,113,536
4Oct 20, 2026 00:55128,64558,411,32946,470,0001,129,0002,113,536
5Oct 20, 2026 00:55128,69458,916,89246,431,0001,186,0002,113,536
6Oct 20, 2026 00:55128,86459,143,64146,490,0001,190,0002,113,536
7Oct 20, 2026 00:55128,87259,076,77746,498,0001,185,0002,113,536
8Oct 20, 2026 00:55128,90559,039,40646,508,0001,187,0002,113,536
9Oct 20, 2026 00:55129,11359,877,10946,550,0001,222,0002,113,536