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 13, 2022 20:04Kenneth MaplesKenneth MaplesScore: 73,503Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 13, 2022 20:0473,05753,850,59424,028,0003,003,0002,277,376
2Oct 13, 2022 20:0473,12252,576,83924,049,0003,006,0002,494,464
3Oct 13, 2022 20:0473,15453,272,61524,060,0003,007,0002,277,376
4Oct 13, 2022 20:0473,18653,743,82924,071,0003,008,0002,502,656
5Oct 13, 2022 20:0473,42751,643,11425,156,0002,012,0002,506,752
6Oct 13, 2022 20:0473,49250,717,87125,178,0002,014,0002,334,720
7Oct 13, 2022 20:0473,50354,508,42325,182,0002,014,0002,498,560
8Oct 13, 2022 20:0473,57356,037,65025,206,0002,016,0002,277,376
9Oct 13, 2022 20:0473,61655,139,96625,221,0002,017,0002,490,368
10Oct 13, 2022 20:0477,93883,004,47728,836,94102,220,032
11Oct 13, 2022 20:0478,10696,537,22628,899,04102,236,416
12Oct 13, 2022 20:0478,331104,257,77628,982,49902,228,224