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 listMay 22, 2024 15:28Maxim ElchuginMaxim ElchuginScore: 1,325,789Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 22, 2024 15:281,184,166501,811,357438,141,57402,273,280
2May 22, 2024 15:281,325,789555,903,532490,541,84802,256,896
3May 22, 2024 15:281,643,976680,158,023608,271,21302,265,088