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 10:48Andrey TsvetkovAndrey TsvetkovScore: 88,970Success
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 10:4888,52684,769,53332,754,53302,183,168
2Jul 15, 2021 10:4888,97096,975,19032,918,98402,183,168
3Jul 15, 2021 10:4889,37296,711,29133,067,56702,179,072