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:04Franek KortaFranek KortaScore: 65,119Success
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:0464,93591,315,18024,025,87102,297,856
2Sep 2, 2023 23:0465,11993,809,08224,094,17502,174,976
3Sep 2, 2023 23:0465,13891,641,22524,101,07102,170,880