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 14:12Yuriy LyfenkoYuriy LyfenkoScore: 88,005Success
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 14:1287,405586,608,31032,339,86302,256,896
2Jul 14, 2021 14:1288,005613,666,72732,561,97802,252,800
3Jul 14, 2021 14:1288,159586,096,04432,618,70002,174,976