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:01Franek KortaFranek KortaScore: 67,684Success
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:0167,15881,097,25624,848,52902,220,032
2Sep 2, 2023 22:0167,46594,790,74224,962,06702,170,880
3Sep 2, 2023 22:0167,64795,722,92825,029,43102,289,664
4Sep 2, 2023 22:0167,68497,411,63425,043,21602,179,072
5Sep 2, 2023 22:0167,72296,851,69725,057,05602,301,952
6Sep 2, 2023 22:0167,90891,944,52125,126,12902,297,856