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 15, 2021 23:34Yurkov AlekseyYurkov AlekseyScore: 165,211Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 15, 2021 23:3498,93895,776,60436,607,07102,277,376
2Jul 15, 2021 23:3499,533109,075,84236,827,12402,269,184
3Jul 15, 2021 23:34100,695105,055,29537,257,05902,273,280
4Jul 15, 2021 23:34164,97386,718,92360,040,0001,000,0002,289,664
5Jul 15, 2021 23:34164,99585,086,30959,047,0002,001,0002,289,664
6Jul 15, 2021 23:34165,08181,760,22360,079,0001,001,0002,269,184
7Jul 15, 2021 23:34165,21184,066,21859,124,0002,004,0002,273,280
8Jul 15, 2021 23:34165,25482,377,24259,140,0002,004,0002,289,664
9Jul 15, 2021 23:34165,28482,952,69060,153,0001,002,0002,531,328
10Jul 15, 2021 23:34165,36285,336,18759,178,0002,006,0002,289,664
11Jul 15, 2021 23:34165,48486,947,21859,222,0002,007,0002,277,376
12Jul 15, 2021 23:34167,08486,098,59659,827,0001,994,0002,289,664