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:32Yuriy LyfenkoYuriy LyfenkoScore: 89,200Success
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:3288,603563,484,92429,803,0002,980,0002,330,624
2Jul 14, 2021 13:3288,838565,024,14530,878,0001,992,0002,326,528
3Jul 14, 2021 13:3288,878558,494,79029,896,0002,989,0002,330,624
4Jul 14, 2021 13:3288,930561,448,97331,907,000997,0002,326,528
5Jul 14, 2021 13:3289,076560,648,34530,961,0001,997,0002,326,528
6Jul 14, 2021 13:3289,181553,695,89430,998,0001,999,0002,326,528
7Jul 14, 2021 13:3289,200561,195,60830,004,0003,000,0002,326,528
8Jul 14, 2021 13:3289,427560,412,86430,080,0003,008,0002,510,848
9Jul 14, 2021 13:3289,761586,473,69933,211,45202,252,800
10Jul 14, 2021 13:3289,982587,789,77333,293,34202,248,704
11Jul 14, 2021 13:3290,632589,614,62733,533,86802,179,072
12Jul 14, 2021 13:3290,724567,693,33232,551,0001,017,0002,330,624