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 listJul 8, 2026 23:44IlyaIlyaError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 8, 2026 23:45031,348,12920,432,0001,216,0002,113,536expected "429496435384 ", got "429496432827 "
2Jul 8, 2026 23:45031,298,21520,485,0001,087,0002,113,536expected "429496513126 ", got "429496512630 "
3Jul 8, 2026 23:4558,46440,389,52620,509,0001,123,0002,113,536
4Jul 8, 2026 23:4558,46731,415,31920,513,0001,120,0002,113,536
5Jul 8, 2026 23:4558,51631,348,68520,441,0001,210,0002,113,536
6Jul 8, 2026 23:4558,56431,408,79620,474,0001,195,0002,113,536
7Jul 8, 2026 23:4558,60831,924,97220,477,0001,208,0002,113,536
8Jul 8, 2026 23:4558,81632,050,05820,536,0001,226,0002,113,536
9Jul 8, 2026 23:4521,624,9108,011,154,2157,850,477,000150,740,0002,113,536