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 listAug 4, 2023 17:11gchebanovgchebanovScore: 79,189Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 4, 2023 17:1177,97897,383,23428,851,94302,244,608
2Aug 4, 2023 17:1179,18988,682,83229,300,08902,248,704
3Aug 4, 2023 17:1180,001110,342,58029,600,34702,244,608