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 listApr 20, 2025 15:12Drew GarciaDrew GarciaScore: 76,076Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 20, 2025 15:1275,50056,438,25726,938,000997,0002,281,472
2Apr 20, 2025 15:1275,57651,270,39925,966,0001,997,0002,269,184
3Apr 20, 2025 15:1275,57851,189,65225,967,0001,997,0002,277,376
4Apr 20, 2025 15:1275,69753,608,20526,008,0002,000,0002,281,472
5Apr 20, 2025 15:1276,07655,760,03226,138,0002,010,0002,281,472
6Apr 20, 2025 15:1276,08653,975,39024,131,0004,021,0002,281,472
7Apr 20, 2025 15:1276,18954,708,26925,170,0003,020,0002,281,472
8Apr 20, 2025 15:1276,40555,853,95926,251,0002,019,0002,281,472
9Apr 20, 2025 15:1276,61154,648,35526,322,0002,024,0002,281,472