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 24, 2022 20:55Kenneth MaplesKenneth MaplesScore: 73,876Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 24, 2022 20:5573,38953,788,47724,137,0003,017,0002,277,376
2Oct 24, 2022 20:5573,42753,666,54024,150,0003,018,0002,502,656
3Oct 24, 2022 20:5573,43049,667,40526,163,0001,006,0002,490,368
4Oct 24, 2022 20:5573,67849,889,34124,232,0003,029,0002,334,720
5Oct 24, 2022 20:5573,68650,670,94024,235,0003,029,0002,277,376
6Oct 24, 2022 20:5573,77853,247,74825,276,0002,022,0002,277,376
7Oct 24, 2022 20:5573,87659,703,15925,310,0002,024,0002,277,376
8Oct 24, 2022 20:5573,91448,811,40625,323,0002,025,0002,277,376
9Oct 24, 2022 20:5574,02256,857,48726,374,0001,014,0002,277,376
10Oct 24, 2022 20:5578,37592,361,80928,998,64302,220,032
11Oct 24, 2022 20:5578,45790,363,82429,029,22202,228,224
12Oct 24, 2022 20:5578,50297,117,66729,045,84102,240,512