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 22, 2024 03:34Huy Duc LeHuy Duc LeScore: 77,946Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 22, 2024 03:3477,10050,908,88827,509,0001,018,0002,285,568
2Feb 22, 2024 03:3477,11649,902,81427,514,0001,019,0002,285,568
3Feb 22, 2024 03:3477,27859,527,66327,572,0001,021,0002,285,568
4Feb 22, 2024 03:3477,36555,623,49326,581,0002,044,0002,285,568
5Feb 22, 2024 03:3477,40555,889,08427,618,0001,022,0002,285,568
6Feb 22, 2024 03:3477,60553,970,98127,689,0001,025,0002,338,816
7Feb 22, 2024 03:3477,94655,882,91825,857,0002,983,0002,498,560
8Feb 22, 2024 03:3477,98657,906,49326,865,0001,990,0002,494,464
9Feb 22, 2024 03:3478,08454,571,76727,895,000996,0002,285,568
10Feb 22, 2024 03:3480,39288,755,43129,744,89202,289,664
11Feb 22, 2024 03:3480,68192,328,14729,851,87502,240,512
12Feb 22, 2024 03:3480,717108,341,57329,865,19902,240,512