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:09Joad NacerJoad NacerScore: 418,609Success
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:09417,169215,352,924154,352,50302,293,760
2May 6, 2024 23:09418,609223,644,972154,885,18002,301,952
3May 6, 2024 23:09419,237225,088,746155,117,77802,301,952