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 28, 2023 15:06apuxbtapuxbtScore: 179,736Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 28, 2023 15:06176,867126,592,19065,440,86002,265,088
2Sep 28, 2023 15:06179,736135,352,37866,502,45202,265,088
3Sep 28, 2023 15:06179,835135,557,17266,539,01502,260,992