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 listSep 10, 2025 19:40Aleksei ShahoikaAleksei ShahoikaScore: 222,157Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 10, 2025 19:40221,324105,778,27579,893,0001,997,0002,510,848
2Sep 10, 2025 19:40222,157108,103,10780,194,0002,004,0002,285,568
3Sep 10, 2025 19:40223,203107,796,87181,578,0001,007,0002,260,992