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 18, 2026 17:43M-RochatM-RochatScore: 59,886Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 18, 2026 17:4559,60834,361,03420,988,0001,067,0002,113,536
2May 18, 2026 17:4559,84531,778,08521,066,0001,077,0002,113,536
3May 18, 2026 17:4559,87033,099,67121,008,0001,144,0002,113,536
4May 18, 2026 17:4559,88333,364,62220,996,0001,161,0002,113,536
5May 18, 2026 17:4559,88633,189,61221,144,0001,014,0002,113,536
6May 18, 2026 17:4559,91633,042,74421,003,0001,166,0002,113,536
7May 18, 2026 17:4559,94031,287,62821,083,0001,095,0002,113,536
8May 18, 2026 17:4559,98332,206,49221,047,0001,147,0002,113,536
9May 18, 2026 17:4560,03231,261,61821,198,0001,014,0002,113,536