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 listApr 19, 2025 00:04emily graceemily graceScore: 70,038Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 19, 2025 00:0569,41150,508,26225,682,00002,281,472
2Apr 19, 2025 00:0569,49754,335,96524,686,0001,028,0002,289,664
3Apr 19, 2025 00:0569,86561,237,87923,862,0001,988,0002,277,376
4Apr 19, 2025 00:0569,87056,789,68223,864,0001,988,0002,269,184
5Apr 19, 2025 00:0469,90354,042,86523,875,0001,989,0002,289,664
6Apr 19, 2025 00:0569,93853,817,79323,887,0001,990,0002,289,664
7Apr 19, 2025 00:0570,03851,746,51923,921,0001,993,0002,523,136
8Apr 19, 2025 00:0570,07853,982,68124,932,000997,0002,265,088
9Apr 19, 2025 00:0470,21948,997,50924,982,000999,0002,371,584
10Apr 19, 2025 00:0470,26552,244,07323,999,0001,999,0002,289,664
11Apr 19, 2025 00:0570,37046,937,45724,035,0002,002,0002,285,568
12Apr 19, 2025 00:0570,43252,148,28524,056,0002,004,0002,289,664