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:25mmalczakmmalczakScore: 74,175Success
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:2973,85392,685,45827,325,62302,265,088
2Sep 25, 2023 22:2574,05177,815,37927,398,77302,269,184
3Sep 25, 2023 22:2974,17384,820,18427,443,87902,269,184
4Sep 25, 2023 22:2974,17583,406,50027,444,67602,269,184
5Sep 25, 2023 22:2574,276107,044,12627,482,05802,265,088
6Sep 25, 2023 22:2574,481101,170,17627,557,99702,260,992