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 11, 2021 08:06Andrey TsvetkovAndrey TsvetkovScore: 90,856Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 11, 2021 08:0690,75096,280,14533,577,50002,232,320
2Sep 11, 2021 08:0690,85692,787,04133,616,74802,228,224
3Sep 11, 2021 08:0691,19389,989,30233,741,49802,232,320