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 15:54Victor MerckléVictor MerckléScore: 67,783Success
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 15:5667,57833,712,44523,784,0001,220,0002,113,536
2May 11, 2026 15:5667,69733,788,07223,862,0001,186,0002,113,536
3May 11, 2026 15:5667,72735,822,52923,871,0001,188,0002,113,536
4May 11, 2026 15:5667,75436,541,16723,862,0001,207,0002,113,536
5May 11, 2026 15:5667,78333,817,25423,796,0001,284,0002,113,536
6May 11, 2026 15:5667,90233,684,30323,934,0001,190,0002,113,536
7May 11, 2026 15:5668,03234,381,25023,946,0001,226,0002,113,536
8May 11, 2026 15:5668,21037,071,90624,050,0001,188,0002,113,536
9May 11, 2026 15:5668,22436,064,62624,056,0001,187,0002,113,536