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 16:17Yuriy LyfenkoYuriy LyfenkoScore: 112,227Success
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 16:17110,99261,232,06238,063,0003,004,0002,523,136
2Jul 13, 2021 16:17110,99572,634,12538,063,0003,005,0002,514,944
3Jul 13, 2021 16:17111,09568,381,81738,098,0003,007,0002,510,848
4Jul 13, 2021 16:17111,21963,012,21439,144,0002,007,0002,519,040
5Jul 13, 2021 16:17111,27862,614,23539,165,0002,008,0002,523,136
6Jul 13, 2021 16:17111,30864,895,02639,175,0002,009,0002,519,040
7Jul 13, 2021 16:17112,22762,790,07540,512,0001,012,0002,375,680
8Jul 13, 2021 16:17112,30365,134,75340,539,0001,013,0002,334,720
9Jul 13, 2021 16:17112,55167,609,92540,629,0001,015,0002,519,040
10Jul 13, 2021 16:17113,637105,493,13542,045,71702,179,072
11Jul 13, 2021 16:17113,784106,649,72542,100,17702,179,072
12Jul 13, 2021 16:17114,714100,925,60142,444,18902,306,048