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 listJul 16, 2023 15:06Paul MasurelPaul MasurelScore: 69,095Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 16, 2023 15:0668,22246,198,05723,223,0002,019,0002,355,200
2Jul 16, 2023 15:0668,47351,011,03923,309,0002,026,0002,347,008
3Jul 16, 2023 15:0668,70046,882,31025,419,00002,289,664
4Jul 16, 2023 15:0668,73252,264,47024,414,0001,017,0002,289,664
5Jul 16, 2023 15:0669,04646,815,48225,547,00002,359,296
6Jul 16, 2023 15:0669,08448,931,42924,539,0001,022,0002,289,664
7Jul 16, 2023 15:0669,09553,533,10424,543,0001,022,0002,355,200
8Jul 16, 2023 15:0670,69250,621,11724,144,0002,012,0002,351,104
9Jul 16, 2023 15:0671,12251,795,48324,291,0002,024,0002,347,008
10Jul 16, 2023 15:0672,09799,045,20126,675,97602,195,456
11Jul 16, 2023 15:0672,23298,973,92126,725,72502,195,456
12Jul 16, 2023 15:0672,714104,580,49526,904,06602,191,360