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 25, 2022 01:16Kenneth MaplesKenneth MaplesScore: 75,384Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 25, 2022 01:1675,20358,146,88824,844,0002,981,0002,502,656
2Oct 25, 2022 01:1675,20358,939,39524,844,0002,981,0002,494,464
3Oct 25, 2022 01:1675,21657,612,75625,843,0001,987,0002,494,464
4Oct 25, 2022 01:1675,26859,152,31225,860,0001,989,0002,502,656
5Oct 25, 2022 01:1675,27854,173,79525,864,0001,989,0002,506,752
6Oct 25, 2022 01:1675,30852,243,94025,874,0001,990,0002,490,368
7Oct 25, 2022 01:1675,38454,203,02425,826,0002,066,0002,273,280
8Oct 25, 2022 01:1675,41152,467,06823,916,0003,986,0002,277,376
9Oct 25, 2022 01:1675,51457,197,75526,943,000997,0002,277,376
10Oct 25, 2022 01:1679,40889,340,49429,380,92602,228,224
11Oct 25, 2022 01:1679,53696,695,34329,428,18302,220,032
12Oct 25, 2022 01:1679,80794,537,58729,528,61602,228,224