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 listDec 29, 2025 15:50Josu San MartinJosu San MartinScore: 139,089Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 29, 2025 15:50137,32275,120,97648,817,0001,992,0002,289,664
2Dec 29, 2025 15:50137,36576,453,22048,832,0001,993,0002,371,584
3Dec 29, 2025 15:50137,42480,189,83248,853,0001,994,0002,289,664
4Dec 29, 2025 15:50138,97680,018,33650,413,0001,008,0002,371,584
5Dec 29, 2025 15:50139,08979,938,45151,463,00002,289,664
6Dec 29, 2025 15:50139,19574,551,46450,493,0001,009,0002,359,296
7Dec 29, 2025 15:50139,48476,622,98950,598,0001,011,0002,289,664
8Dec 29, 2025 15:50140,79580,914,89550,091,0002,003,0002,367,488
9Dec 29, 2025 15:50141,34373,968,25250,286,0002,011,0002,289,664