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:56M-RochatM-RochatScore: 61,486Success
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:5761,35631,572,29521,628,0001,074,0002,113,536
2May 17, 2026 11:5761,36732,115,31521,621,0001,085,0002,113,536
3May 17, 2026 11:5761,40531,561,23521,618,0001,102,0002,113,536
4May 17, 2026 11:5761,48133,982,17821,660,0001,088,0002,113,536
5May 17, 2026 11:5761,48632,042,65621,665,0001,085,0002,113,536
6May 17, 2026 11:5761,49732,940,88921,667,0001,087,0002,113,536
7May 17, 2026 11:5761,68634,526,95721,738,0001,086,0002,113,536
8May 17, 2026 11:5761,72732,105,92021,757,0001,082,0002,113,536
9May 17, 2026 11:5761,87031,712,81221,806,0001,086,0002,113,536