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 listAug 29, 2023 11:19mmalczakmmalczakScore: 5,399,829Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 29, 2023 11:195,378,7022,048,116,7011,990,119,70102,297,856
2Aug 29, 2023 11:195,399,8292,059,881,3641,997,936,74902,293,760
3Aug 29, 2023 11:195,410,1792,066,397,9252,001,766,33802,297,856