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 listAug 2, 2022 12:59Yuriy LyfenkoYuriy LyfenkoScore: 61,959Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2022 12:5961,75749,409,54820,863,0001,987,0002,527,232
2Aug 2, 2022 12:5961,77350,015,70821,863,000993,0002,289,664
3Aug 2, 2022 12:5961,81147,648,75120,882,0001,988,0002,289,664
4Aug 2, 2022 12:5961,83051,652,12921,883,000994,0002,265,088
5Aug 2, 2022 12:5961,85449,629,77220,896,0001,990,0002,277,376
6Aug 2, 2022 12:5961,92249,439,96720,919,0001,992,0002,289,664
7Aug 2, 2022 12:5961,95953,261,17120,932,0001,993,0002,289,664
8Aug 2, 2022 12:5962,02749,992,27220,955,0001,995,0002,273,280
9Aug 2, 2022 12:5962,10852,799,55520,982,0001,998,0002,289,664
10Aug 2, 2022 12:5964,507101,472,95423,867,71402,269,184
11Aug 2, 2022 12:5964,66883,920,75323,926,99402,252,800
12Aug 2, 2022 12:5964,97588,998,83924,040,74602,273,280