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 11, 2022 22:03Kenneth MaplesKenneth MaplesScore: 80,181Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 11, 2022 22:0379,52248,292,59628,409,0001,014,0002,277,376
2Oct 11, 2022 22:0379,63054,160,62728,481,000982,0002,502,656
3Oct 11, 2022 22:0379,73051,304,01127,466,0002,034,0002,277,376
4Oct 11, 2022 22:0379,77650,251,38828,500,0001,017,0002,277,376
5Oct 11, 2022 22:0379,80550,811,76524,437,0005,091,0002,277,376
6Oct 11, 2022 22:0380,04354,644,33328,595,0001,021,0002,502,656
7Oct 11, 2022 22:0380,18158,660,43227,621,0002,046,0002,498,560
8Oct 11, 2022 22:0380,60356,151,84928,829,000994,0002,498,560
9Oct 11, 2022 22:0380,60856,068,65929,825,00002,277,376
10Oct 11, 2022 22:0383,89384,690,89431,040,47602,228,224
11Oct 11, 2022 22:0384,327104,432,17531,200,92902,228,224
12Oct 11, 2022 22:0384,59994,724,24531,301,71202,220,032