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 listOct 11, 2022 22:04Kenneth MaplesKenneth MaplesScore: 80,076Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 11, 2022 22:0479,53252,817,92826,383,0003,044,0002,498,560
2Oct 11, 2022 22:0479,71953,855,13227,462,0002,034,0002,277,376
3Oct 11, 2022 22:0479,72756,860,33528,482,0001,017,0002,502,656
4Oct 11, 2022 22:0479,76252,666,45729,512,00002,277,376
5Oct 11, 2022 22:0479,81958,656,07427,497,0002,036,0002,277,376
6Oct 11, 2022 22:0479,89753,301,91829,562,00002,338,816
7Oct 11, 2022 22:0480,07658,105,73128,607,0001,021,0002,277,376
8Oct 11, 2022 22:0480,11459,721,85627,598,0002,044,0002,277,376
9Oct 11, 2022 22:0480,25956,546,04126,624,0003,072,0002,502,656
10Oct 11, 2022 22:0483,727101,686,32830,979,00702,228,224
11Oct 11, 2022 22:0484,08390,905,85031,110,56202,224,128
12Oct 11, 2022 22:0484,744103,201,62631,355,37102,224,128