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 listSep 2, 2021 05:43Ilya AniskovetsIlya AniskovetsScore: 21,383,598Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 2, 2021 05:4321,203,3627,910,615,5527,845,244,07902,297,856
2Sep 2, 2021 05:4321,383,5987,965,255,4087,911,931,31002,306,048
3Sep 2, 2021 05:4321,464,9587,998,527,1547,942,034,57202,285,568