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:51Kenneth MaplesKenneth MaplesScore: 73,754Success
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:5173,22252,996,77825,086,0002,006,0002,277,376
2Oct 24, 2022 20:5173,30849,100,32326,120,0001,004,0002,498,560
3Oct 24, 2022 20:5173,41949,881,86925,153,0002,012,0002,277,376
4Oct 24, 2022 20:5173,47049,863,05624,164,0003,020,0002,277,376
5Oct 24, 2022 20:5173,53255,142,22925,192,0002,015,0002,498,560
6Oct 24, 2022 20:5173,69251,777,09724,237,0003,029,0002,277,376
7Oct 24, 2022 20:5173,75454,708,46924,257,0003,032,0002,498,560
8Oct 24, 2022 20:5173,83050,022,54525,294,0002,023,0002,498,560
9Oct 24, 2022 20:5174,06249,415,76325,374,0002,029,0002,277,376
10Oct 24, 2022 20:5178,10097,033,15228,896,97502,220,032
11Oct 24, 2022 20:5178,178119,161,75628,925,98402,228,224
12Oct 24, 2022 20:5178,58197,227,99729,074,92002,228,224