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 16:49Paul MasurelPaul MasurelScore: 71,349Success
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 16:4970,73248,545,69625,165,0001,006,0002,285,568
2Jul 16, 2023 16:4970,87052,511,46925,214,0001,008,0002,314,240
3Jul 16, 2023 16:4970,96853,559,26524,239,0002,019,0002,314,240
4Jul 16, 2023 16:4971,22749,333,50525,341,0001,013,0002,285,568
5Jul 16, 2023 16:4971,30355,130,99224,353,0002,029,0002,285,568
6Jul 16, 2023 16:4971,34347,503,43225,382,0001,015,0002,310,144
7Jul 16, 2023 16:4971,34948,698,77825,384,0001,015,0002,285,568
8Jul 16, 2023 16:4971,43254,671,04525,414,0001,016,0002,301,952
9Jul 16, 2023 16:4971,52452,097,54725,447,0001,017,0002,285,568
10Jul 16, 2023 16:4974,470104,077,88127,553,96802,273,280
11Jul 16, 2023 16:4974,51381,448,33327,569,79302,277,376
12Jul 16, 2023 16:4974,58298,249,58327,595,47802,285,568