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 23, 2025 12:03Emanuele BolognesiEmanuele BolognesiScore: 164,754Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 23, 2025 12:03163,77889,936,85859,589,0001,009,0002,359,296
2Apr 23, 2025 12:03164,43086,312,88359,842,000997,0002,285,568
3Apr 23, 2025 12:03164,57686,593,53760,893,00002,285,568
4Apr 23, 2025 12:03164,69586,969,71758,940,0001,997,0002,359,296
5Apr 23, 2025 12:03164,75490,571,15058,961,0001,998,0002,285,568
6Apr 23, 2025 12:03165,34682,531,30559,173,0002,005,0002,359,296
7Apr 23, 2025 12:03165,89584,272,43861,381,00002,363,392
8Apr 23, 2025 12:03166,05987,825,68461,442,00002,371,584
9Apr 23, 2025 12:03166,42488,827,95961,577,00002,367,488