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 26, 2026 06:29IlyaIlyaError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 26, 2026 06:30033,681,21522,710,0001,225,0002,113,536expected "429496459031 ", got "429496453915 "
2Jun 26, 2026 06:30033,292,86922,826,0001,221,0002,113,536expected "429496542694 ", got "429496539192 "
3Jun 26, 2026 06:3062,19432,283,37221,813,0001,199,0002,113,536
4Jun 26, 2026 06:3062,47532,833,57621,870,0001,246,0002,113,536
5Jun 26, 2026 06:3062,84333,014,88222,032,0001,220,0002,113,536
6Jun 26, 2026 06:3064,45933,078,95222,728,0001,122,0002,113,536
7Jun 26, 2026 06:3064,67533,161,47722,710,0001,220,0002,113,536
8Jun 26, 2026 06:3064,84033,457,75022,764,0001,227,0002,113,536
9Jun 26, 2026 06:3065,15433,850,95522,860,0001,247,0002,113,536