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 26, 2026 23:32Charles CabergsCharles CabergsScore: 70,854Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 26, 2026 23:3370,62150,052,89324,120,0002,010,0002,351,104
2Apr 26, 2026 23:3370,66241,093,56724,134,0002,011,0002,363,392
3Apr 26, 2026 23:3370,73751,510,62224,160,0002,013,0002,363,392
4Apr 26, 2026 23:3370,76442,533,35124,169,0002,014,0002,359,296
5Apr 26, 2026 23:3370,85446,031,71524,200,0002,016,0002,310,144
6Apr 26, 2026 23:3370,85640,838,49425,209,0001,008,0002,306,048
7Apr 26, 2026 23:3371,02740,406,95825,270,0001,010,0002,367,488
8Apr 26, 2026 23:3371,10044,245,77226,307,00002,306,048
9Apr 26, 2026 23:3371,34040,891,23825,381,0001,015,0002,351,104