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 21:52Franek KortaFranek KortaScore: 65,523Success
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 21:5265,40161,604,24624,198,22102,170,880
2Sep 2, 2023 21:5265,52394,681,93124,243,61702,170,880
3Sep 2, 2023 21:5265,646109,110,41124,289,16802,297,856