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 19:20Yuriy LyfenkoYuriy LyfenkoScore: 447,338Success
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 19:20447,311221,624,480165,505,06102,187,264
2Jul 8, 2021 19:20447,338231,883,084165,515,15302,195,456
3Jul 8, 2021 19:20447,621222,999,089165,619,90202,195,456