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:07gchebanovgchebanovScore: 165,057Success
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:07163,923138,173,69460,651,39602,240,512
2Aug 4, 2023 17:07165,057128,265,58061,071,22802,240,512
3Aug 4, 2023 17:07165,447135,009,40161,215,20802,248,704