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 20:54M-RochatM-RochatScore: 67,259Success
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 20:5566,89733,490,66823,717,0001,035,0002,113,536
2May 16, 2026 20:5566,98636,236,34023,761,0001,024,0002,113,536
3May 16, 2026 20:5567,06435,236,29123,777,0001,037,0002,113,536
4May 16, 2026 20:5567,13735,524,80123,821,0001,020,0002,113,536
5May 16, 2026 20:5567,25934,026,94823,797,0001,089,0002,113,536
6May 16, 2026 20:5567,37833,730,09023,893,0001,037,0002,113,536
7May 16, 2026 20:5567,38934,804,42923,907,0001,027,0002,113,536
8May 16, 2026 20:5567,44835,768,61123,924,0001,032,0002,113,536
9May 16, 2026 20:5567,84533,808,27424,067,0001,036,0002,113,536