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 listAug 6, 2022 19:35Franek KortaFranek KortaScore: 73,986Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 6, 2022 19:3573,61453,241,98824,211,0003,026,0002,269,184
2Aug 6, 2022 19:3573,65753,686,76324,225,0003,028,0002,269,184
3Aug 6, 2022 19:3573,67355,992,61725,240,0002,019,0002,281,472
4Aug 6, 2022 19:3573,70850,005,42725,252,0002,020,0002,281,472
5Aug 6, 2022 19:3573,82750,031,26124,281,0003,035,0002,527,232
6Aug 6, 2022 19:3573,92254,561,87626,338,0001,013,0002,269,184
7Aug 6, 2022 19:3573,98649,121,72023,320,0004,055,0002,379,776
8Aug 6, 2022 19:3574,01951,132,06724,344,0003,043,0002,281,472
9Aug 6, 2022 19:3574,09550,980,46326,400,0001,015,0002,285,568
10Aug 6, 2022 19:3577,946102,585,55428,840,05502,269,184
11Aug 6, 2022 19:3578,12297,043,45828,905,12502,252,800
12Aug 6, 2022 19:3578,339102,742,57228,985,53102,260,992