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:12Andrey TsvetkovAndrey TsvetkovScore: 88,926Success
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:1288,278101,153,43732,662,82902,183,168
2Jul 14, 2021 10:1288,92695,150,01532,902,70102,191,360
3Jul 14, 2021 10:1289,241100,531,53133,019,21202,183,168