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:53M-RochatM-RochatScore: 60,383Success
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:5460,17834,042,66421,223,0001,043,0002,113,536
2May 17, 2026 11:5460,20531,166,07221,230,0001,046,0002,113,536
3May 17, 2026 11:5460,23230,961,64821,279,0001,007,0002,113,536
4May 17, 2026 11:5460,28631,489,25221,228,0001,078,0002,113,536
5May 17, 2026 11:5460,38331,176,13621,326,0001,016,0002,113,536
6May 17, 2026 11:5460,41331,394,77321,255,0001,098,0002,113,536
7May 17, 2026 11:5460,43534,026,42721,262,0001,099,0002,113,536
8May 17, 2026 11:5460,48334,179,27221,368,0001,011,0002,113,536
9May 17, 2026 11:5460,90534,000,74021,470,0001,065,0002,113,536