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 listOct 5, 2023 17:06apuxbtapuxbtScore: 76,764Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 5, 2023 17:0676,62190,683,55928,349,85702,260,992
2Oct 5, 2023 17:0676,76494,878,05228,402,82802,265,088
3Oct 5, 2023 17:0677,06295,238,55328,513,05602,265,088