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:21Franek KortaFranek KortaScore: 130,513Success
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:21129,922114,854,52148,071,20202,252,800
2Aug 2, 2022 17:21130,513117,526,46648,289,90702,281,472
3Aug 2, 2022 17:21130,942133,338,72448,448,58202,293,760