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:33Kenneth MaplesKenneth MaplesScore: 73,792Success
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:3373,30049,376,96425,112,0002,009,0002,277,376
2Oct 24, 2022 20:3373,40550,753,78025,149,0002,011,0002,498,560
3Oct 24, 2022 20:3373,43849,854,75424,153,0003,019,0002,502,656
4Oct 24, 2022 20:3373,48948,311,15224,170,0003,021,0002,281,472
5Oct 24, 2022 20:3373,59749,487,42425,214,0002,017,0002,277,376
6Oct 24, 2022 20:3373,72755,137,54925,259,0002,020,0002,277,376
7Oct 24, 2022 20:3373,79254,143,59724,270,0003,033,0002,277,376
8Oct 24, 2022 20:3373,94149,099,33226,345,0001,013,0002,277,376
9Oct 24, 2022 20:3374,01949,711,28225,359,0002,028,0002,277,376
10Oct 24, 2022 20:3378,02193,123,79628,867,67202,228,224
11Oct 24, 2022 20:3378,039107,756,71028,874,55402,228,224
12Oct 24, 2022 20:3378,80996,963,80229,159,45302,224,128