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:08Franek KortaFranek KortaScore: 65,602Success
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:0865,47995,758,48024,227,25902,240,512
2Sep 2, 2023 23:0865,60295,199,79524,272,90002,236,416
3Sep 2, 2023 23:0865,69693,465,43424,307,58902,236,416