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 listJan 28, 2025 11:16Oleg KovalovOleg KovalovScore: 138,973Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 28, 2025 11:16138,07676,877,47249,085,0002,003,0002,330,624
2Jan 28, 2025 11:16138,23878,166,16350,146,0001,002,0002,330,624
3Jan 28, 2025 11:16138,51179,931,47650,245,0001,004,0002,478,080
4Jan 28, 2025 11:16138,93574,812,28548,383,0003,023,0002,330,624
5Jan 28, 2025 11:16138,97378,039,84050,412,0001,008,0002,486,272
6Jan 28, 2025 11:16139,41178,221,23350,571,0001,011,0002,486,272
7Jan 28, 2025 11:16139,50077,055,01050,603,0001,012,0002,330,624
8Jan 28, 2025 11:16139,78175,672,53550,705,0001,014,0002,314,240
9Jan 28, 2025 11:16140,75983,608,31149,077,0003,004,0002,330,624