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:23mmalczakmmalczakScore: 74,295Success
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:2374,215102,208,94927,459,46602,260,992
2Sep 25, 2023 22:2374,29599,053,38527,489,06002,265,088
3Sep 25, 2023 22:2374,85896,515,95527,697,56002,256,896