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 10, 2021 13:49Andrey TsvetkovAndrey TsvetkovScore: 90,996Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 10, 2021 13:4990,793111,969,78533,593,45202,228,224
2Sep 10, 2021 13:4990,996122,259,20833,668,66602,228,224
3Sep 10, 2021 13:4992,082104,424,91434,070,50402,244,608