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:40M-RochatM-RochatScore: 66,945Success
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:4266,23533,508,05723,500,0001,007,0002,113,536
2May 17, 2026 11:4266,47033,353,30723,579,0001,015,0002,113,536
3May 17, 2026 11:4266,51833,350,12223,599,0001,013,0002,113,536
4May 17, 2026 11:4266,90033,579,13623,742,0001,011,0002,113,536
5May 17, 2026 11:4266,94533,709,71523,761,0001,009,0002,113,536
6May 17, 2026 11:4267,02133,648,45823,785,0001,013,0002,113,536
7May 17, 2026 11:4267,36434,184,48723,918,0001,007,0002,113,536
8May 17, 2026 11:4267,37235,444,71523,912,0001,016,0002,113,536
9May 17, 2026 11:4267,50835,389,70423,970,0001,008,0002,113,536