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 7, 2021 18:14Andrey TsvetkovAndrey TsvetkovScore: 91,319Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 7, 2021 18:1490,87794,763,81033,624,47402,236,416
2Sep 7, 2021 18:1491,31996,523,10833,788,09402,232,320
3Sep 7, 2021 18:1491,920109,475,49334,010,30902,228,224