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 11, 2026 20:39Victor MerckléVictor MerckléScore: 64,745Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2026 20:4064,42733,138,46422,836,0001,002,0002,113,536
2May 11, 2026 20:4064,45634,503,95622,838,0001,011,0002,113,536
3May 11, 2026 20:4064,52934,942,94522,871,0001,005,0002,113,536
4May 11, 2026 20:4064,64532,675,67222,898,0001,021,0002,113,536
5May 11, 2026 20:4064,74535,376,31322,840,0001,116,0002,113,536
6May 11, 2026 20:4064,84334,767,25522,897,0001,095,0002,113,536
7May 11, 2026 20:4064,97232,766,33323,023,0001,017,0002,113,536
8May 11, 2026 20:4065,02132,797,24723,036,0001,022,0002,113,536
9May 11, 2026 20:4065,13532,832,08823,018,0001,082,0002,113,536