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 listJul 15, 2021 23:38Yurkov AlekseyYurkov AlekseyScore: 99,392Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 15, 2021 23:3897,37663,997,27634,028,0002,001,0002,527,232
2Jul 15, 2021 23:3898,01162,351,86634,250,0002,014,0002,375,680
3Jul 15, 2021 23:3898,16858,843,02034,305,0002,017,0002,523,136
4Jul 15, 2021 23:3898,29759,426,48034,350,0002,020,0002,273,280
5Jul 15, 2021 23:3898,60060,024,42735,469,0001,013,0002,281,472
6Jul 15, 2021 23:3899,053111,815,46436,649,69602,269,184
7Jul 15, 2021 23:3899,39295,726,51536,775,13002,265,088
8Jul 15, 2021 23:3899,53064,694,92934,836,0001,990,0002,289,664
9Jul 15, 2021 23:3899,75965,498,47335,886,0001,025,0002,289,664
10Jul 15, 2021 23:38100,08165,265,04435,029,0002,001,0002,289,664
11Jul 15, 2021 23:38100,432110,846,01937,159,97702,273,280
12Jul 15, 2021 23:38117,96575,475,29042,632,0001,015,0002,289,664