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 5, 2022 20:17Franek KortaFranek KortaScore: 81,838Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 5, 2022 20:1779,66555,976,27927,444,0002,032,0002,523,136
2Aug 5, 2022 20:1779,79257,434,80328,505,0001,018,0002,273,280
3Aug 5, 2022 20:1780,00057,858,81928,580,0001,020,0002,367,488
4Aug 5, 2022 20:1780,06561,649,19928,603,0001,021,0002,281,472
5Aug 5, 2022 20:1780,94153,923,19726,954,0002,994,0002,273,280
6Aug 5, 2022 20:1781,42455,718,52328,119,0002,008,0002,527,232
7Aug 5, 2022 20:1781,83856,425,52627,252,0003,028,0002,281,472
8Aug 5, 2022 20:1782,10051,515,58729,365,0001,012,0002,281,472
9Aug 5, 2022 20:1782,80858,355,30629,618,0001,021,0002,269,184
10Aug 5, 2022 20:1785,35898,941,08431,582,60402,265,088
11Aug 5, 2022 20:1788,44194,644,94632,723,17302,256,896
12Aug 5, 2022 20:1788,656114,087,84832,802,78802,256,896