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:47Franek KortaFranek KortaScore: 65,783Success
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:4765,16295,176,91324,109,80502,252,800
2Sep 2, 2023 21:4765,783103,614,75024,339,74502,256,896
3Sep 2, 2023 21:4765,873101,964,09824,373,12702,252,800