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 listAug 23, 2026 15:44Andrew EpsteinAndrew EpsteinScore: 69,229Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 23, 2026 15:5669,08135,415,71524,476,0001,084,0002,113,536
2Aug 23, 2026 15:5669,15135,366,58824,511,0001,075,0002,113,536
3Aug 23, 2026 15:5669,21035,366,89424,528,0001,080,0002,113,536
4Aug 23, 2026 15:5669,21035,379,16724,524,0001,084,0002,113,536
5Aug 23, 2026 15:5669,22935,501,83024,530,0001,085,0002,113,536
6Aug 23, 2026 15:5669,48335,510,85224,696,0001,013,0002,113,536
7Aug 23, 2026 15:5669,83535,630,47324,763,0001,076,0002,113,536
8Aug 23, 2026 15:5669,95135,659,49724,859,0001,023,0002,113,536
9Aug 23, 2026 15:5670,09135,886,63024,853,0001,081,0002,113,536