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 25, 2021 09:47Ilya AniskovetsIlya AniskovetsScore: 21,717,834Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 25, 2021 09:4721,699,3608,083,802,9848,028,763,06002,285,568
2Sep 25, 2021 09:4721,717,8348,102,488,4358,035,598,63202,285,568
3Sep 25, 2021 09:4721,835,1218,153,600,8718,078,994,85302,281,472