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 8, 2021 19:46Yuriy LyfenkoYuriy LyfenkoScore: 112,432Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 8, 2021 19:46110,97064,302,37738,055,0003,004,0002,334,720
2Jul 8, 2021 19:46111,02767,800,92239,077,0002,003,0002,334,720
3Jul 8, 2021 19:46111,09765,243,39238,099,0003,007,0002,523,136
4Jul 8, 2021 19:46111,42766,837,49238,212,0003,016,0002,326,528
5Jul 8, 2021 19:46111,70362,190,15938,306,0003,024,0002,334,720
6Jul 8, 2021 19:46111,97665,725,26739,410,0002,021,0002,310,144
7Jul 8, 2021 19:46112,43268,546,04340,586,0001,014,0002,514,944
8Jul 8, 2021 19:46112,98475,507,88140,809,000995,0002,514,944
9Jul 8, 2021 19:46114,125114,124,43042,226,35702,191,360
10Jul 8, 2021 19:46114,778100,802,30542,467,83902,195,456
11Jul 8, 2021 19:46114,91164,806,46841,505,0001,012,0002,523,136
12Jul 8, 2021 19:46115,689106,382,89342,804,93902,187,264