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 14, 2021 13:54Yuriy LyfenkoYuriy LyfenkoScore: 87,859Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 14, 2021 13:5486,784555,821,61029,100,0003,010,0002,326,528
2Jul 14, 2021 13:5486,862551,355,03330,131,0002,008,0002,326,528
3Jul 14, 2021 13:5486,959553,187,07929,159,0003,016,0002,330,624
4Jul 14, 2021 13:5487,578586,922,66832,403,68002,248,704
5Jul 14, 2021 13:5487,816563,010,78630,462,0002,030,0002,326,528
6Jul 14, 2021 13:5487,822561,540,71031,479,0001,015,0002,510,848
7Jul 14, 2021 13:5487,859558,747,70131,493,0001,015,0002,326,528
8Jul 14, 2021 13:5487,957597,165,15532,543,92802,301,952
9Jul 14, 2021 13:5487,984559,045,11530,520,0002,034,0002,326,528
10Jul 14, 2021 13:5488,005558,154,81131,545,0001,017,0002,330,624
11Jul 14, 2021 13:5488,500556,985,67529,769,0002,976,0002,330,624
12Jul 14, 2021 13:5488,649590,246,51932,800,03302,248,704