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 18:05Yuriy LyfenkoYuriy LyfenkoScore: 61,535Success
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 18:0560,959551,765,04621,530,0001,025,0002,285,568
2Sep 15, 2021 18:0560,968546,058,92421,533,0001,025,0002,289,664
3Sep 15, 2021 18:0561,105554,504,31122,609,00002,281,472
4Sep 15, 2021 18:0561,143552,415,92521,595,0001,028,0002,281,472
5Sep 15, 2021 18:0561,478550,560,84120,769,0001,978,0002,289,664
6Sep 15, 2021 18:0561,514551,189,64120,781,0001,979,0002,281,472
7Sep 15, 2021 18:0561,535554,012,84120,789,0001,979,0002,289,664
8Sep 15, 2021 18:0561,546555,967,45120,792,0001,980,0002,281,472
9Sep 15, 2021 18:0561,562548,950,49022,778,00002,281,472
10Sep 15, 2021 18:0564,563578,813,32023,888,35302,252,800
11Sep 15, 2021 18:0564,605585,326,64823,903,68802,277,376
12Sep 15, 2021 18:0564,679585,458,85623,931,24402,265,088