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 listDec 24, 2023 02:46Kenneth MaplesKenneth MaplesScore: 73,689Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 24, 2023 02:4673,21148,856,88425,082,0002,006,0002,498,560
2Dec 24, 2023 02:4673,39551,613,97125,145,0002,011,0002,490,368
3Dec 24, 2023 02:4673,41652,757,42125,152,0002,012,0002,289,664
4Dec 24, 2023 02:4673,45750,360,42325,166,0002,013,0002,289,664
5Dec 24, 2023 02:4673,52752,379,53325,190,0002,015,0002,289,664
6Dec 24, 2023 02:4673,54350,648,72325,196,0002,015,0002,486,272
7Dec 24, 2023 02:4673,68951,751,77325,246,0002,019,0002,289,664
8Dec 24, 2023 02:4673,69555,084,15925,248,0002,019,0002,502,656
9Dec 24, 2023 02:4673,94355,039,00326,382,000977,0002,289,664
10Dec 24, 2023 02:4676,29993,067,41728,230,50302,232,320
11Dec 24, 2023 02:4676,41397,032,14428,272,99102,236,416
12Dec 24, 2023 02:4676,73394,165,39728,391,08102,232,320