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:38M-RochatM-RochatScore: 67,221Success
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:4066,75933,441,51023,685,0001,016,0002,113,536
2May 17, 2026 11:4067,01636,350,69923,789,0001,007,0002,113,536
3May 17, 2026 11:4067,15933,974,46923,811,0001,038,0002,113,536
4May 17, 2026 11:4067,19735,100,97823,855,0001,008,0002,113,536
5May 17, 2026 11:4067,22133,848,57923,856,0001,016,0002,113,536
6May 17, 2026 11:4067,23235,771,12623,869,0001,007,0002,113,536
7May 17, 2026 11:4067,35435,399,91923,913,0001,008,0002,113,536
8May 17, 2026 11:4067,40233,649,16623,913,0001,026,0002,113,536
9May 17, 2026 11:4067,45135,471,52223,927,0001,030,0002,113,536