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 listDec 24, 2023 02:45Kenneth MaplesKenneth MaplesScore: 73,584Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 24, 2023 02:4573,10846,377,95825,047,0002,003,0002,502,656
2Dec 24, 2023 02:4573,13048,671,11525,054,0002,004,0002,498,560
3Dec 24, 2023 02:4573,27848,500,46725,105,0002,008,0002,289,664
4Dec 24, 2023 02:4573,33250,149,08026,129,0001,004,0002,490,368
5Dec 24, 2023 02:4573,48449,981,01425,175,0002,014,0002,289,664
6Dec 24, 2023 02:4573,52450,330,93725,189,0002,015,0002,289,664
7Dec 24, 2023 02:4573,58450,467,51825,210,0002,016,0002,289,664
8Dec 24, 2023 02:4573,63553,531,54425,227,0002,018,0002,498,560
9Dec 24, 2023 02:4573,88650,991,54126,326,0001,012,0002,498,560
10Dec 24, 2023 02:4576,22194,461,18428,201,66202,220,032
11Dec 24, 2023 02:4576,51888,195,58528,311,81202,228,224
12Dec 24, 2023 02:4576,577102,410,13628,333,50902,215,936