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:48Robert BurkeRobert BurkeScore: 62,659Success
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:4862,42743,966,40522,094,0001,004,0002,424,832
2Aug 2, 2022 08:4862,43843,074,83122,098,0001,004,0002,433,024
3Aug 2, 2022 08:4862,44649,003,63422,101,0001,004,0002,281,472
4Aug 2, 2022 08:4862,45942,064,26522,106,0001,004,0002,281,472
5Aug 2, 2022 08:4862,50846,861,50922,123,0001,005,0002,424,832
6Aug 2, 2022 08:4862,54947,681,99022,137,0001,006,0002,424,832
7Aug 2, 2022 08:4862,65946,126,49721,168,0002,016,0002,281,472
8Aug 2, 2022 08:4862,74944,521,02921,199,0002,018,0002,424,832
9Aug 2, 2022 08:4862,76845,702,77722,215,0001,009,0002,424,832
10Aug 2, 2022 08:4865,81283,122,83924,350,58402,256,896
11Aug 2, 2022 08:4865,95785,025,93424,404,10302,281,472
12Aug 2, 2022 08:4866,26185,068,12424,516,60102,289,664