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 21, 2023 18:58mmalczakmmalczakScore: 86,369Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 21, 2023 18:5885,87094,420,32931,771,98002,277,376
2Sep 21, 2023 18:5886,369101,128,25031,956,49902,256,896
3Sep 21, 2023 18:5886,47198,600,85031,994,18002,265,088