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 15, 2021 19:58Igor VolkovIgor VolkovScore: 156,076Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 15, 2021 19:58155,783118,588,53957,639,80602,260,992
2Aug 15, 2021 19:58156,076122,486,98157,748,02302,265,088
3Aug 15, 2021 19:58157,137119,247,75658,140,73002,265,088