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 listJul 15, 2021 13:59Andrey TsvetkovAndrey TsvetkovScore: 90,842Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 15, 2021 13:5990,57394,758,69433,511,86202,179,072
2Jul 15, 2021 13:5990,84295,920,65833,611,63802,301,952
3Jul 15, 2021 13:5990,87395,084,79133,622,85202,306,048