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:50Andrey TsvetkovAndrey TsvetkovScore: 91,672Success
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:5090,870102,607,67833,622,04602,220,032
2Sep 10, 2021 13:5091,672101,743,61033,918,74902,232,320
3Sep 10, 2021 13:5091,72194,367,47033,936,93402,232,320