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:31Kenneth MaplesKenneth MaplesScore: 74,162Success
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:3173,48647,775,11226,183,0001,007,0002,277,376
2Oct 24, 2022 20:3173,50356,684,91125,182,0002,014,0002,277,376
3Oct 24, 2022 20:3173,61652,505,02025,221,0002,017,0002,502,656
4Oct 24, 2022 20:3173,64353,524,36325,230,0002,018,0002,277,376
5Oct 24, 2022 20:3173,67653,410,16125,241,0002,019,0002,277,376
6Oct 24, 2022 20:3174,03050,610,11226,377,0001,014,0002,277,376
7Oct 24, 2022 20:3174,16250,389,24325,408,0002,032,0002,277,376
8Oct 24, 2022 20:3174,21649,263,85824,409,0003,051,0002,334,720
9Oct 24, 2022 20:3174,77660,739,19424,593,0003,074,0002,498,560
10Oct 24, 2022 20:3177,93675,837,20328,836,43602,232,320
11Oct 24, 2022 20:3178,491109,718,51229,041,72502,224,128
12Oct 24, 2022 20:3178,66591,608,36629,106,18102,232,320