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 4, 2024 14:13Andrey LikhachevAndrey LikhachevScore: 70,657Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 4, 2024 14:1369,84952,373,68623,856,0001,988,0002,375,680
2Aug 4, 2024 14:1370,46553,684,68924,067,0002,005,0002,371,584
3Aug 4, 2024 14:1370,50850,109,27125,085,0001,003,0002,506,752
4Aug 4, 2024 14:1370,53556,036,93424,091,0002,007,0002,289,664
5Aug 4, 2024 14:1370,56848,751,89425,106,0001,004,0002,289,664
6Aug 4, 2024 14:1370,62447,533,82425,126,0001,005,0002,371,584
7Aug 4, 2024 14:1370,65751,795,23225,138,0001,005,0002,359,296
8Aug 4, 2024 14:1370,66848,823,95324,136,0002,011,0002,371,584
9Aug 4, 2024 14:1370,89747,031,86925,224,0001,008,0002,289,664
10Aug 4, 2024 14:1373,34789,684,75927,138,44302,342,912
11Aug 4, 2024 14:1374,01692,343,52927,386,02302,211,840
12Aug 4, 2024 14:1374,620101,093,71227,609,42102,211,840