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 22:26Yurkov AlekseyYurkov AlekseyScore: 106,741Success
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 22:26105,14962,213,58736,910,0001,995,0002,392,064
2Jul 8, 2021 22:26105,19565,780,36836,926,0001,996,0002,289,664
3Jul 8, 2021 22:26105,28164,159,53936,957,0001,997,0002,289,664
4Jul 8, 2021 22:26105,31465,262,58336,968,0001,998,0002,289,664
5Jul 8, 2021 22:26105,77662,912,67537,130,0002,007,0002,289,664
6Jul 8, 2021 22:26106,44965,905,62237,367,0002,019,0002,289,664
7Jul 8, 2021 22:26106,74166,324,52037,469,0002,025,0002,289,664
8Jul 8, 2021 22:26106,85163,326,57038,522,0001,013,0002,289,664
9Jul 8, 2021 22:26107,26263,614,25238,670,0001,017,0002,289,664
10Jul 8, 2021 22:26131,589111,369,19748,688,07802,265,088
11Jul 8, 2021 22:26131,702105,306,21848,729,70402,265,088
12Jul 8, 2021 22:26131,897119,461,90148,801,88002,269,184