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 17:23Yuriy LyfenkoYuriy LyfenkoScore: 96,908Success
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 17:2395,95758,940,83533,476,0002,028,0002,519,040
2Jul 13, 2021 17:2396,06255,311,26234,528,0001,015,0002,527,232
3Jul 13, 2021 17:2396,13559,738,80234,554,0001,016,0002,334,720
4Jul 13, 2021 17:2396,21661,965,85033,566,0002,034,0002,334,720
5Jul 13, 2021 17:2396,45163,985,12934,668,0001,019,0002,338,816
6Jul 13, 2021 17:2396,88464,861,12033,856,0001,991,0002,514,944
7Jul 13, 2021 17:2396,90866,639,29333,864,0001,992,0002,523,136
8Jul 13, 2021 17:2396,91667,941,55632,871,0002,988,0002,519,040
9Jul 13, 2021 17:2396,93059,645,62733,872,0001,992,0002,523,136
10Jul 13, 2021 17:2398,53689,451,95236,458,19402,191,360
11Jul 13, 2021 17:2399,006103,385,27836,632,23802,183,168
12Jul 13, 2021 17:2399,35698,428,76736,761,77402,195,456