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:59Yuriy LyfenkoYuriy LyfenkoScore: 87,957Success
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:5986,503562,206,22130,006,0002,000,0002,514,944
2Jul 14, 2021 13:5987,011555,426,72729,176,0003,018,0002,326,528
3Jul 14, 2021 13:5987,151558,900,32629,223,0003,023,0002,326,528
4Jul 14, 2021 13:5987,259553,804,25230,269,0002,017,0002,330,624
5Jul 14, 2021 13:5987,276557,395,98431,283,0001,009,0002,326,528
6Jul 14, 2021 13:5987,595594,519,22132,410,04202,252,800
7Jul 14, 2021 13:5987,957565,611,40031,527,0001,017,0002,330,624
8Jul 14, 2021 13:5988,051566,923,40930,543,0002,036,0002,506,752
9Jul 14, 2021 13:5988,506594,093,64432,747,33102,252,800
10Jul 14, 2021 13:5988,569594,749,84732,770,44902,252,800
11Jul 14, 2021 13:5988,646555,602,27829,818,0002,981,0002,326,528
12Jul 14, 2021 13:5989,100561,645,54329,970,0002,997,0002,326,528