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 listMar 26, 2023 11:17Yurkov AlekseyYurkov AlekseyScore: 141,512Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 26, 2023 11:17141,280115,292,29452,273,44102,273,280
2Mar 26, 2023 11:17141,512109,927,36252,359,44902,260,992
3Mar 26, 2023 11:17141,753123,643,02752,448,58402,265,088