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 15, 2025 10:58Aniruddha DebAniruddha DebScore: 70,605Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 15, 2025 10:5870,04945,101,88524,922,000996,0002,433,024
2Mar 15, 2025 10:5870,20548,199,12724,977,000999,0002,269,184
3Mar 15, 2025 10:5870,28952,881,19124,007,0002,000,0002,428,928
4Mar 15, 2025 10:5870,32251,239,75225,019,0001,000,0002,269,184
5Mar 15, 2025 10:5870,60549,125,04325,120,0001,004,0002,269,184
6Mar 15, 2025 10:5870,64352,504,18625,133,0001,005,0002,420,736
7Mar 15, 2025 10:5870,86252,247,31325,211,0001,008,0002,269,184
8Mar 15, 2025 10:5870,92754,757,59825,234,0001,009,0002,428,928
9Mar 15, 2025 10:5871,03546,706,92825,273,0001,010,0002,269,184