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 listSep 20, 2023 19:57mmalczakmmalczakScore: 101,808Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 20, 2023 19:5786,034130,787,29331,832,60602,281,472
2Sep 20, 2023 19:5786,170103,672,75231,882,81202,248,704
3Sep 20, 2023 19:5787,49998,367,95232,374,79702,265,088
4Sep 20, 2023 19:57100,37662,518,88036,136,0001,003,0002,289,664
5Sep 20, 2023 19:57101,41163,018,77436,508,0001,014,0002,289,664
6Sep 20, 2023 19:57101,65763,431,46537,613,00002,527,232
7Sep 20, 2023 19:57101,80866,803,41436,651,0001,018,0002,289,664
8Sep 20, 2023 19:57101,81662,308,32636,654,0001,018,0002,289,664
9Sep 20, 2023 19:57102,29264,969,79335,856,0001,992,0002,289,664
10Sep 20, 2023 19:57102,33564,023,02236,868,000996,0002,289,664
11Sep 20, 2023 19:57102,68459,914,26236,994,000999,0002,281,472
12Sep 20, 2023 19:57102,94363,039,31336,085,0002,004,0002,527,232