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 16:59gchebanovgchebanovScore: 79,389Success
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 16:5978,82681,097,28029,165,64702,228,224
2Aug 4, 2023 16:5979,389114,835,86929,374,02402,228,224
3Aug 4, 2023 16:5979,760106,596,59529,511,23802,240,512