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 23:03Franek KortaFranek KortaScore: 65,272Success
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 23:0365,02375,609,14124,058,54902,285,568
2Sep 2, 2023 23:0365,272118,460,79424,150,66802,293,760
3Sep 2, 2023 23:0365,28398,471,98424,154,58202,301,952