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 14, 2023 07:38mmalczakmmalczakScore: 651,633Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 14, 2023 07:38646,960315,781,015239,375,15902,293,760
2Sep 14, 2023 07:38651,633297,324,017241,104,34202,297,856
3Sep 14, 2023 07:38652,784307,638,478241,530,16902,293,760