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 21:02IlyaIlyaScore: 59,356Success
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 21:0359,02931,433,48320,730,0001,111,0002,113,536
2Jun 29, 2026 21:0359,08631,267,36120,739,0001,123,0002,113,536
3Jun 29, 2026 21:0359,19731,340,92320,799,0001,104,0002,113,536
4Jun 29, 2026 21:0359,34831,388,90120,806,0001,153,0002,113,536
5Jun 29, 2026 21:0359,35631,444,86020,769,0001,193,0002,113,536
6Jun 29, 2026 21:0359,47031,942,60920,794,0001,210,0002,113,536
7Jun 29, 2026 21:0359,47831,883,83720,804,0001,203,0002,113,536
8Jun 29, 2026 21:0359,58931,513,07220,864,0001,184,0002,113,536
9Jun 29, 2026 21:0359,62731,940,82120,869,0001,193,0002,113,536