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 8, 2021 12:37Yuriy LyfenkoYuriy LyfenkoScore: 77,425Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 8, 2021 12:3777,202591,080,39528,564,86502,248,704
2Jul 8, 2021 12:3777,425584,863,08428,647,13802,248,704
3Jul 8, 2021 12:3777,727578,866,05328,758,90302,269,184