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 6, 2022 17:33Franek KortaFranek KortaScore: 78,122Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 6, 2022 17:3377,97353,021,59528,850,00002,527,232
2Aug 6, 2022 17:3377,97353,082,82224,871,0003,979,0002,281,472
3Aug 6, 2022 17:3377,99753,617,19426,869,0001,990,0002,285,568
4Aug 6, 2022 17:3378,00860,128,09226,873,0001,990,0002,281,472
5Aug 6, 2022 17:3378,03260,595,88225,886,0002,986,0002,273,280
6Aug 6, 2022 17:3378,04651,448,94526,886,0001,991,0002,281,472
7Aug 6, 2022 17:3378,12253,393,44326,912,0001,993,0002,273,280
8Aug 6, 2022 17:3378,32754,704,12726,983,0001,998,0002,527,232
9Aug 6, 2022 17:3378,38451,958,90027,002,0002,000,0002,355,200
10Aug 6, 2022 17:3382,44991,507,26530,506,28702,265,088
11Aug 6, 2022 17:3383,025100,139,28830,719,25402,265,088
12Aug 6, 2022 17:3383,17397,602,39430,774,07402,277,376