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 11, 2021 19:11Sergey StreminSergey StreminScore: 71,862Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 11, 2021 19:1170,96251,531,34225,247,0001,009,0002,494,464
2Sep 11, 2021 19:1171,47056,580,83525,427,0001,017,0002,539,520
3Sep 11, 2021 19:1171,56549,116,02725,461,0001,018,0002,281,472
4Sep 11, 2021 19:1171,67648,831,47125,500,0001,020,0002,285,568
5Sep 11, 2021 19:1171,72753,688,46825,519,0001,020,0002,498,560
6Sep 11, 2021 19:1171,73848,387,87126,543,00002,281,472
7Sep 11, 2021 19:1171,86253,648,15225,567,0001,022,0002,277,376
8Sep 11, 2021 19:1171,89747,250,13625,579,0001,023,0002,281,472
9Sep 11, 2021 19:1172,58652,985,21024,868,0001,989,0002,281,472
10Sep 11, 2021 19:1174,59894,386,89327,601,29902,191,360
11Sep 11, 2021 19:1174,78398,622,98827,669,67902,195,456
12Sep 11, 2021 19:1175,02184,659,79127,757,59502,211,840