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 29, 2021 17:49piculpiculScore: 70,249Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 29, 2021 17:4970,12198,075,56725,944,75002,265,088
2Sep 29, 2021 17:4970,249102,239,41225,992,28702,252,800
3Sep 29, 2021 17:4971,124110,821,73526,315,92602,269,184