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 listNov 23, 2024 16:54E SequeiraE SequeiraScore: 174,357Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 23, 2024 16:54173,14192,277,65062,061,0002,001,0002,289,664
2Nov 23, 2024 16:54173,54395,719,82863,208,0001,003,0002,273,280
3Nov 23, 2024 16:54173,56890,318,52462,214,0002,006,0002,289,664
4Nov 23, 2024 16:54173,89591,777,85562,331,0002,010,0002,289,664
5Nov 23, 2024 16:55173,96288,141,72863,361,0001,005,0002,273,280
6Nov 23, 2024 16:54174,35794,459,06663,504,0001,008,0002,289,664
7Nov 23, 2024 16:55174,35786,904,88863,504,0001,008,0002,289,664
8Nov 23, 2024 16:54174,62792,114,10663,603,0001,009,0002,523,136
9Nov 23, 2024 16:54174,692101,845,96963,627,0001,009,0002,289,664
10Nov 23, 2024 16:54175,19590,982,85462,828,0001,994,0002,289,664
11Nov 23, 2024 16:54175,23294,693,41963,839,000997,0002,289,664
12Nov 23, 2024 16:55178,61992,240,37365,088,0001,001,0002,289,664