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 listMay 6, 2024 23:20Joad NacerJoad NacerScore: 417,034Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 6, 2024 23:20416,540211,891,182154,119,82202,297,856
2May 6, 2024 23:20417,034218,202,967154,302,44102,301,952
3May 6, 2024 23:20417,155222,111,110154,347,29302,301,952