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 listSep 15, 2021 17:40piculpiculScore: 73,727Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 15, 2021 17:4073,37854,509,05225,139,0002,011,0002,523,136
2Sep 15, 2021 17:4073,40050,985,40225,147,0002,011,0002,523,136
3Sep 15, 2021 17:4073,47352,881,14526,179,0001,006,0002,289,664
4Sep 15, 2021 17:4073,56548,370,03725,203,0002,016,0002,289,664
5Sep 15, 2021 17:4073,63549,382,96225,227,0002,018,0002,289,664
6Sep 15, 2021 17:4073,64150,339,38925,229,0002,018,0002,265,088
7Sep 15, 2021 17:4073,72749,818,12625,259,0002,020,0002,289,664
8Sep 15, 2021 17:4073,81950,663,24325,290,0002,023,0002,289,664
9Sep 15, 2021 17:4073,93048,907,08726,341,0001,013,0002,289,664
10Sep 15, 2021 17:4075,74097,184,26328,023,84802,248,704
11Sep 15, 2021 17:4075,79599,426,10028,044,14602,256,896
12Sep 15, 2021 17:4076,02991,422,71028,130,87302,260,992