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 14:53Paul MasurelPaul MasurelScore: 70,716Success
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 14:5370,13255,589,88824,951,000998,0002,285,568
2Jul 16, 2023 14:5370,14649,047,56923,958,0001,996,0002,351,104
3Jul 16, 2023 14:5370,25750,187,84024,996,000999,0002,285,568
4Jul 16, 2023 14:5370,33051,676,28124,021,0002,001,0002,363,392
5Jul 16, 2023 14:5370,39557,836,99824,043,0002,003,0002,355,200
6Jul 16, 2023 14:5370,55752,597,79824,098,0002,008,0002,355,200
7Jul 16, 2023 14:5370,71649,213,74524,153,0002,012,0002,351,104
8Jul 16, 2023 14:5374,470112,858,68827,553,74302,314,240
9Jul 16, 2023 14:5374,64292,662,23427,617,54902,314,240
10Jul 16, 2023 14:5374,80353,736,23926,652,0001,025,0002,285,568
11Jul 16, 2023 14:5374,85954,307,28226,673,0001,025,0002,355,200
12Jul 16, 2023 14:5377,023102,528,63328,498,52402,318,336