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:04Paul MasurelPaul MasurelScore: 69,219Success
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:0468,57347,847,19925,372,00002,355,200
2Jul 16, 2023 15:0468,75948,462,02124,424,0001,017,0002,281,472
3Jul 16, 2023 15:0468,77646,390,69324,430,0001,017,0002,453,504
4Jul 16, 2023 15:0468,82449,619,71325,465,00002,351,104
5Jul 16, 2023 15:0468,92447,567,15425,502,00002,281,472
6Jul 16, 2023 15:0468,96543,691,15424,497,0001,020,0002,285,568
7Jul 16, 2023 15:0469,21959,483,26125,611,00002,285,568
8Jul 16, 2023 15:0470,82250,478,00924,189,0002,015,0002,359,296
9Jul 16, 2023 15:0472,25597,405,51726,734,24002,191,360
10Jul 16, 2023 15:0472,95986,605,01126,994,79202,252,800
11Jul 16, 2023 15:0475,25760,740,76226,851,000994,0002,351,104
12Jul 16, 2023 15:0479,624118,698,38329,460,80102,191,360