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 29, 2021 17:51piculpiculScore: 70,622Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 29, 2021 17:5170,38097,056,19026,040,54502,273,280
2Sep 29, 2021 17:5170,622100,072,62726,130,31602,260,992
3Sep 29, 2021 17:5170,74681,348,55826,176,14902,260,992