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 13, 2021 11:10Andrey TsvetkovAndrey TsvetkovScore: 95,608Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 13, 2021 11:1094,77357,449,50432,061,0003,005,0002,334,720
2Jul 13, 2021 11:1094,95158,376,03532,121,0003,011,0002,334,720
3Jul 13, 2021 11:1095,06256,488,88432,159,0003,014,0002,527,232
4Jul 13, 2021 11:1095,14154,787,49832,185,0003,017,0002,531,328
5Jul 13, 2021 11:1095,18161,425,12632,199,0003,018,0002,523,136
6Jul 13, 2021 11:1095,35955,486,87133,267,0002,016,0002,519,040
7Jul 13, 2021 11:1095,60858,682,21232,343,0003,032,0002,527,232
8Jul 13, 2021 11:1095,74966,268,41133,403,0002,024,0002,334,720
9Jul 13, 2021 11:1097,69555,332,08834,139,0002,008,0002,334,720
10Jul 13, 2021 11:1098,469100,648,42436,433,54802,203,648
11Jul 13, 2021 11:1098,541100,055,57236,460,20302,199,552
12Jul 13, 2021 11:1098,86999,833,32536,581,69102,207,744