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 25, 2023 22:15mmalczakmmalczakScore: 74,231Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 25, 2023 22:1574,047100,864,73827,397,46402,265,088
2Sep 25, 2023 22:1574,23194,562,56227,465,32102,260,992
3Sep 25, 2023 22:1574,85593,969,03527,696,18802,265,088