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 2, 2022 18:38Franek KortaFranek KortaScore: 176,308Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2022 18:38176,189126,410,29365,189,82202,256,896
2Aug 2, 2022 18:38176,308123,962,95965,234,13802,265,088
3Aug 2, 2022 18:38176,538125,615,57765,319,02602,256,896