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:23Andrey TsvetkovAndrey TsvetkovScore: 102,673Success
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:23100,77058,388,37434,262,0003,023,0002,527,232
2Jul 13, 2021 11:23101,03260,588,48434,351,0003,031,0002,334,720
3Jul 13, 2021 11:23101,66864,877,65237,617,00002,523,136
4Jul 13, 2021 11:23101,88463,549,13136,679,0001,018,0002,527,232
5Jul 13, 2021 11:23102,29562,240,67135,857,0001,992,0002,527,232
6Jul 13, 2021 11:23102,36872,956,21836,853,0001,023,0002,334,720
7Jul 13, 2021 11:23102,67364,023,36935,990,0001,999,0002,531,328
8Jul 13, 2021 11:23103,18968,065,73136,171,0002,009,0002,334,720
9Jul 13, 2021 11:23103,653102,452,92538,351,74702,199,552
10Jul 13, 2021 11:23103,942101,660,88038,458,38002,203,648
11Jul 13, 2021 11:23104,119106,173,18738,524,17602,203,648
12Jul 13, 2021 11:23105,56265,765,27337,055,0002,003,0002,527,232