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 16, 2026 17:45M-RochatM-RochatScore: 67,035Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 16, 2026 17:4666,88934,007,06223,702,0001,047,0002,113,536
2May 16, 2026 17:4666,92734,666,85323,755,0001,008,0002,113,536
3May 16, 2026 17:4667,01033,696,55223,755,0001,039,0002,113,536
4May 16, 2026 17:4667,03533,375,91723,789,0001,014,0002,117,632
5May 16, 2026 17:4667,03533,448,90223,780,0001,023,0002,113,536
6May 16, 2026 17:4667,20835,408,67323,840,0001,027,0002,113,536
7May 16, 2026 17:4667,34035,566,23923,899,0001,017,0002,113,536
8May 16, 2026 17:4667,57533,751,89723,995,0001,008,0002,113,536
9May 16, 2026 17:4667,86235,733,43524,085,0001,024,0002,113,536