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:44M-RochatM-RochatScore: 60,381Success
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:4560,21631,110,46521,255,0001,025,0002,113,536
2May 17, 2026 11:4560,27032,028,21521,289,0001,011,0002,113,536
3May 17, 2026 11:4560,31031,580,60821,284,0001,031,0002,113,536
4May 17, 2026 11:4560,35133,080,97421,316,0001,014,0002,113,536
5May 17, 2026 11:4560,38133,178,04021,332,0001,009,0002,113,536
6May 17, 2026 11:4560,38931,262,44021,314,0001,030,0002,113,536
7May 17, 2026 11:4560,44831,981,68821,358,0001,008,0002,113,536
8May 17, 2026 11:4560,51831,321,40521,373,0001,019,0002,113,536
9May 17, 2026 11:4560,63534,005,19221,363,0001,072,0002,113,536