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 17:59Franek KortaFranek KortaScore: 137,005Success
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 17:59136,622115,390,70950,550,13502,220,032
2Aug 2, 2022 17:59137,005109,142,20350,691,72302,228,224
3Aug 2, 2022 17:59137,331124,925,58450,812,47902,220,032