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 listJul 8, 2021 19:50Yuriy LyfenkoYuriy LyfenkoScore: 112,170Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 8, 2021 19:50111,00064,206,08239,067,0002,003,0002,334,720
2Jul 8, 2021 19:50111,24968,443,18538,151,0003,011,0002,334,720
3Jul 8, 2021 19:50111,33865,407,71039,186,0002,009,0002,334,720
4Jul 8, 2021 19:50111,50363,607,47039,244,0002,012,0002,334,720
5Jul 8, 2021 19:50111,51963,473,54338,243,0003,019,0002,334,720
6Jul 8, 2021 19:50111,57063,449,01139,268,0002,013,0002,334,720
7Jul 8, 2021 19:50112,17062,343,42039,479,0002,024,0002,334,720
8Jul 8, 2021 19:50112,25964,353,64340,523,0001,013,0002,334,720
9Jul 8, 2021 19:50112,45770,897,45239,580,0002,029,0002,510,848
10Jul 8, 2021 19:50114,52395,542,24242,373,57102,179,072
11Jul 8, 2021 19:50114,899115,470,89842,512,72702,183,168
12Jul 8, 2021 19:50115,233107,186,49942,636,31802,187,264