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 9, 2023 16:25Franek KortaFranek KortaScore: 77,151Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 9, 2023 16:2573,96850,262,37226,355,0001,013,0002,531,328
2Apr 9, 2023 16:2575,72253,334,59626,016,0002,001,0002,441,216
3Apr 9, 2023 16:2576,25450,497,89927,207,0001,007,0002,445,312
4Apr 9, 2023 16:2576,37652,145,79127,250,0001,009,0002,445,312
5Apr 9, 2023 16:2577,00060,610,28928,490,00002,531,328
6Apr 9, 2023 16:2577,09251,735,13628,524,00002,445,312
7Apr 9, 2023 16:2577,15150,659,12027,527,0001,019,0002,531,328
8Apr 9, 2023 16:2577,40859,532,49227,619,0001,022,0002,269,184
9Apr 9, 2023 16:2578,31948,780,33626,980,0001,998,0002,265,088
10Apr 9, 2023 16:2580,61193,778,03929,825,92802,301,952
11Apr 9, 2023 16:2582,89293,098,82130,669,94602,289,664
12Apr 9, 2023 16:2583,03994,429,35030,724,28502,260,992