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:07e1011e1011Score: 84,751Success
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:1083,77543,425,60429,891,0001,106,0002,113,536
2Oct 20, 2026 09:1083,94341,965,85629,878,0001,181,0002,113,536
3Oct 20, 2026 09:1084,05442,464,23329,922,0001,178,0002,113,536
4Oct 20, 2026 09:1084,20542,019,62430,041,0001,115,0002,113,536
5Oct 20, 2026 09:1084,75142,711,32530,172,0001,186,0002,113,536
6Oct 20, 2026 09:1084,75942,850,73130,158,0001,203,0002,113,536
7Oct 20, 2026 09:1084,88342,823,84230,213,0001,194,0002,113,536
8Oct 20, 2026 09:1096,07847,068,71234,471,0001,078,0002,113,536
9Oct 20, 2026 09:1096,42946,640,45334,458,0001,221,0002,113,536