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 27, 2023 16:14apuxbtapuxbtScore: 2,012,572Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 27, 2023 16:141,958,262783,101,599724,557,02302,183,168
2Sep 27, 2023 16:142,012,572815,040,834744,651,81402,285,568
3Sep 27, 2023 16:142,017,287822,855,978746,396,02102,277,376