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 listFeb 15, 2023 17:24LiamLiamScore: 100,441Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 15, 2023 17:2498,97867,702,45836,622,00002,289,664
2Feb 15, 2023 17:2499,85960,169,39334,951,0001,997,0002,277,376
3Feb 15, 2023 17:2499,94965,030,08135,982,000999,0002,289,664
4Feb 15, 2023 17:24100,18659,099,92136,068,0001,001,0002,277,376
5Feb 15, 2023 17:24100,24664,766,26035,087,0002,004,0002,281,472
6Feb 15, 2023 17:24100,33858,082,65836,122,0001,003,0002,371,584
7Feb 15, 2023 17:24100,44165,183,92935,155,0002,008,0002,289,664
8Feb 15, 2023 17:24100,84663,761,72435,297,0002,016,0002,289,664
9Feb 15, 2023 17:24100,95757,719,33235,335,0002,019,0002,281,472
10Feb 15, 2023 17:24101,810116,089,47737,669,60802,277,376
11Feb 15, 2023 17:24102,010135,012,07137,743,87302,281,472
12Feb 15, 2023 17:24102,590107,028,97137,958,35502,273,280