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 listMay 17, 2026 11:47M-RochatM-RochatScore: 68,164Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 11:4867,95935,105,82324,132,0001,013,0002,113,536
2May 17, 2026 11:4868,04034,684,56624,160,0001,015,0002,113,536
3May 17, 2026 11:4868,15636,608,55724,203,0001,015,0002,113,536
4May 17, 2026 11:4868,15935,998,50724,208,0001,011,0002,113,536
5May 17, 2026 11:4868,16436,416,33924,199,0001,022,0002,113,536
6May 17, 2026 11:4868,24036,116,25824,241,0001,008,0002,113,536
7May 17, 2026 11:4868,37836,029,62324,269,0001,031,0002,113,536
8May 17, 2026 11:4868,43534,735,37024,293,0001,028,0002,113,536
9May 17, 2026 11:4868,52736,536,84924,345,0001,010,0002,113,536