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 09:00Robert BurkeRobert BurkeScore: 63,230Success
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 09:0062,91642,995,94322,267,0001,012,0002,281,472
2Aug 2, 2022 09:0062,93041,138,49823,284,00002,281,472
3Aug 2, 2022 09:0063,06550,948,34323,334,00002,433,024
4Aug 2, 2022 09:0063,06547,395,93122,320,0001,014,0002,428,928
5Aug 2, 2022 09:0063,13551,138,41223,360,00002,437,120
6Aug 2, 2022 09:0063,20842,811,31422,371,0001,016,0002,433,024
7Aug 2, 2022 09:0063,23044,947,35823,395,00002,281,472
8Aug 2, 2022 09:0063,29752,266,59922,402,0001,018,0002,428,928
9Aug 2, 2022 09:0063,50044,282,08023,495,00002,433,024
10Aug 2, 2022 09:0065,61586,253,09824,277,66202,285,568
11Aug 2, 2022 09:0065,74892,260,35224,326,76302,285,568
12Aug 2, 2022 09:0065,81289,918,19124,350,30202,277,376