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 24, 2023 21:25mmalczakmmalczakScore: 76,206Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 24, 2023 21:2575,58776,712,63527,967,24402,265,088
2Sep 24, 2023 21:2576,20699,494,68328,196,29902,265,088
3Sep 24, 2023 21:2576,294103,007,74028,228,66002,269,184