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 listApr 27, 2026 02:13Charles CabergsCharles CabergsScore: 70,891Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 27, 2026 02:1470,77547,920,22624,173,0002,014,0002,367,488
2Apr 27, 2026 02:1470,81343,428,62424,186,0002,015,0002,351,104
3Apr 27, 2026 02:1470,84541,067,32024,197,0002,016,0002,359,296
4Apr 27, 2026 02:1470,87543,590,99824,207,0002,017,0002,359,296
5Apr 27, 2026 02:1470,89146,347,73124,213,0002,017,0002,355,200
6Apr 27, 2026 02:1471,05644,669,21425,280,0001,011,0002,306,048
7Apr 27, 2026 02:1471,17240,230,95925,322,0001,012,0002,453,504
8Apr 27, 2026 02:1476,40043,024,61727,259,0001,009,0002,297,856
9Apr 27, 2026 02:1477,65643,395,38026,752,0001,981,0002,293,760