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 listMar 25, 2023 20:37Yurkov AlekseyYurkov AlekseyScore: 98,603Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 25, 2023 20:3797,53559,073,57234,084,0002,004,0002,289,664
2Mar 25, 2023 20:3797,70860,168,41434,144,0002,008,0002,265,088
3Mar 25, 2023 20:3798,48957,310,56835,429,0001,012,0002,289,664
4Mar 25, 2023 20:3798,50862,891,20135,436,0001,012,0002,289,664
5Mar 25, 2023 20:3798,50857,791,88834,424,0002,024,0002,289,664
6Mar 25, 2023 20:3798,51159,060,99635,437,0001,012,0002,289,664
7Mar 25, 2023 20:3798,60356,774,65035,470,0001,013,0002,289,664
8Mar 25, 2023 20:3798,98460,194,36635,607,0001,017,0002,289,664
9Mar 25, 2023 20:3799,21392,873,23936,708,81502,265,088
10Mar 25, 2023 20:3799,56862,550,34834,849,0001,991,0002,273,280
11Mar 25, 2023 20:3799,934110,271,37036,975,75902,277,376
12Mar 25, 2023 20:37100,10699,792,56637,039,40402,269,184