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:33Yuriy LyfenkoYuriy LyfenkoScore: 96,414Success
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:3395,55461,649,71432,325,0003,030,0002,514,944
2Jul 13, 2021 17:3395,67359,938,43432,365,0003,034,0002,523,136
3Jul 13, 2021 17:3395,83558,094,61934,446,0001,013,0002,334,720
4Jul 13, 2021 17:3395,89565,505,58734,468,0001,013,0002,527,232
5Jul 13, 2021 17:3395,98160,724,47734,499,0001,014,0002,510,848
6Jul 13, 2021 17:3396,04660,519,87633,507,0002,030,0002,519,040
7Jul 13, 2021 17:3396,41465,686,60834,654,0001,019,0002,334,720
8Jul 13, 2021 17:3396,57660,276,75932,671,0003,062,0002,523,136
9Jul 13, 2021 17:3396,91664,116,34633,867,0001,992,0002,523,136
10Jul 13, 2021 17:3398,241101,990,33736,349,04302,187,264
11Jul 13, 2021 17:3398,698104,657,73236,518,21602,183,168
12Jul 13, 2021 17:3398,793106,589,43436,553,28502,256,896