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 13, 2021 10:16Andrey TsvetkovAndrey TsvetkovScore: 144,318Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 13, 2021 10:16144,010125,432,60753,283,61102,207,744
2Jul 13, 2021 10:17144,044106,310,51953,296,20402,203,648
3Jul 13, 2021 10:17144,075111,250,85353,307,85302,203,648
4Jul 13, 2021 10:16144,318118,570,77253,397,47702,191,360
5Jul 13, 2021 10:16144,706118,214,98653,541,10802,211,840
6Jul 13, 2021 10:17144,788116,378,73253,571,65702,203,648