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 listAug 2, 2022 08:55Robert BurkeRobert BurkeScore: 62,838Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2022 08:5562,49248,392,25422,117,0001,005,0002,281,472
2Aug 2, 2022 08:5562,67843,413,31421,175,0002,016,0002,523,136
3Aug 2, 2022 08:5562,75446,395,23422,210,0001,009,0002,281,472
4Aug 2, 2022 08:5562,78450,751,30022,220,0001,010,0002,281,472
5Aug 2, 2022 08:5562,79244,238,49521,213,0002,020,0002,281,472
6Aug 2, 2022 08:5562,80545,022,34221,218,0002,020,0002,445,312
7Aug 2, 2022 08:5562,83846,800,89622,240,0001,010,0002,281,472
8Aug 2, 2022 08:5563,00540,600,54122,299,0001,013,0002,281,472
9Aug 2, 2022 08:5563,08953,365,83621,314,0002,029,0002,428,928
10Aug 2, 2022 08:5565,76998,238,78124,334,37802,260,992
11Aug 2, 2022 08:5565,94587,429,02824,399,69302,293,760
12Aug 2, 2022 08:5566,04284,926,42324,435,54402,293,760