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 19:42piculpiculError
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 19:2900000Error: No answer to stdout. Died or killed?
2Sep 15, 2021 19:4271,71448,684,33025,514,0001,020,0002,269,184
3Sep 15, 2021 19:4271,77656,692,66825,536,0001,021,0002,289,664
4Sep 15, 2021 19:4271,90356,425,50825,581,0001,023,0002,531,328
5Sep 15, 2021 19:4272,01652,761,12325,622,0001,024,0002,265,088
6Sep 15, 2021 19:4272,02252,901,07225,624,0001,024,0002,289,664
7Sep 15, 2021 19:4272,02759,275,50725,625,0001,025,0002,289,664
8Sep 15, 2021 19:4272,55156,847,04526,844,00002,277,376
9Sep 15, 2021 19:4272,60053,917,22124,873,0001,989,0002,523,136
10Sep 15, 2021 19:4272,61655,865,42624,878,0001,990,0002,269,184
11Sep 15, 2021 19:4275,18491,543,07327,818,01902,260,992
12Sep 15, 2021 19:4275,368101,899,54027,886,11902,265,088
13Sep 15, 2021 19:4275,61898,712,43927,978,78502,269,184