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,120Success
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:1178,14293,383,85828,912,42202,236,416
2Aug 4, 2023 17:1179,120105,221,40429,274,23002,248,704
3Aug 4, 2023 17:1179,13099,016,50929,278,25402,248,704