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 14, 2021 10:25Andrey TsvetkovAndrey TsvetkovScore: 211,268Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 14, 2021 10:25211,242132,653,84778,159,36102,174,976
2Jul 14, 2021 10:25211,268130,862,49078,168,99802,179,072
3Jul 14, 2021 10:25211,294135,856,42578,178,87202,183,168