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 2, 2023 22:28Franek KortaFranek KortaScore: 67,587Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 2, 2023 22:2867,36897,754,63824,926,15802,289,664
2Sep 2, 2023 22:2867,58785,442,62825,007,35702,289,664
3Sep 2, 2023 22:2868,08691,861,56625,191,77702,170,880