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 18:02Yuriy LyfenkoYuriy LyfenkoScore: 88,789Success
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 18:0287,08153,612,67029,200,0003,020,0002,314,240
2Jul 13, 2021 18:0287,96557,078,89530,513,0002,034,0002,498,560
3Jul 13, 2021 18:0288,03059,953,73131,554,0001,017,0002,314,240
4Jul 13, 2021 18:0288,27859,393,01731,643,0001,020,0002,342,912
5Jul 13, 2021 18:0288,33858,559,73631,664,0001,021,0002,314,240
6Jul 13, 2021 18:0288,34160,764,69130,644,0002,042,0002,490,368
7Jul 13, 2021 18:0288,78959,890,01029,866,0002,986,0002,486,272
8Jul 13, 2021 18:0288,912109,847,81332,897,31302,289,664
9Jul 13, 2021 18:0289,22256,393,68431,012,0002,000,0002,482,176
10Jul 13, 2021 18:0289,23058,700,25730,014,0003,001,0002,318,336
11Jul 13, 2021 18:0289,77185,487,91033,215,29002,285,568
12Jul 13, 2021 18:0290,166104,413,48333,361,26002,285,568