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 30, 2023 21:08Franek KortaFranek KortaScore: 65,599Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 30, 2023 21:0865,29685,546,86824,159,55502,293,760
2Aug 30, 2023 21:0865,59987,100,01724,271,60302,174,976
3Aug 30, 2023 21:0865,99388,288,53224,417,46502,179,072