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 21, 2026 16:35Charles CabergsCharles CabergsScore: 70,764Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 21, 2026 16:3670,55945,907,61224,099,0002,008,0002,351,104
2Apr 21, 2026 16:3670,65644,826,02124,132,0002,011,0002,367,488
3Apr 21, 2026 16:3670,69146,415,03225,150,0001,006,0002,367,488
4Apr 21, 2026 16:3670,70844,546,42724,150,0002,012,0002,355,200
5Apr 21, 2026 16:3670,76440,507,05325,176,0001,007,0002,453,504
6Apr 21, 2026 16:3670,88641,921,37125,220,0001,008,0002,367,488
7Apr 21, 2026 16:3670,97546,520,26226,261,00002,363,392
8Apr 21, 2026 16:3671,02142,764,46325,268,0001,010,0002,306,048
9Apr 21, 2026 16:3671,13245,967,06725,307,0001,012,0002,363,392