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 listJun 29, 2026 12:27IlyaIlyaError
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 29, 2026 12:28036,267,81225,166,0001,206,0002,113,536expected "429496531545 ", got "429496529970 "
2Jun 29, 2026 12:2870,52435,554,76124,992,0001,102,0002,113,536
3Jun 29, 2026 12:2870,54535,610,13524,984,0001,118,0002,113,536
4Jun 29, 2026 12:2870,85436,123,44425,019,0001,197,0002,113,536
5Jun 29, 2026 12:2870,96736,164,02325,069,0001,189,0002,113,536
6Jun 29, 2026 12:2871,00536,222,07325,093,0001,179,0002,113,536
7Jun 29, 2026 12:2871,03536,180,47025,081,0001,202,0002,113,536
8Jun 29, 2026 12:2871,22436,263,81525,160,0001,193,0002,113,536
9Jun 29, 2026 12:2871,34036,406,93725,180,0001,216,0002,113,536