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 listJun 8, 2024 13:45Joad NacerJoad NacerScore: 68,460Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 8, 2024 13:4568,21787,733,49125,240,42002,269,184
2Jun 8, 2024 13:4568,46091,987,84925,330,22702,252,800
3Jun 8, 2024 13:4568,81088,928,28425,459,54802,260,992