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 listJul 8, 2021 19:42Yuriy LyfenkoYuriy LyfenkoScore: 112,222Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 8, 2021 19:42111,17670,049,35739,129,0002,006,0002,506,752
2Jul 8, 2021 19:42111,19263,718,99238,131,0003,010,0002,334,720
3Jul 8, 2021 19:42111,38466,251,67539,202,0002,010,0002,519,040
4Jul 8, 2021 19:42111,38660,883,05539,203,0002,010,0002,334,720
5Jul 8, 2021 19:42111,40061,219,63439,208,0002,010,0002,514,944
6Jul 8, 2021 19:42111,40862,954,69139,211,0002,010,0002,383,872
7Jul 8, 2021 19:42112,22265,594,41839,497,0002,025,0002,523,136
8Jul 8, 2021 19:42112,36568,628,08640,561,0001,014,0002,514,944
9Jul 8, 2021 19:42112,41671,874,28840,580,0001,014,0002,334,720
10Jul 8, 2021 19:42114,338106,010,97842,305,07902,191,360
11Jul 8, 2021 19:42114,850111,390,76142,494,57502,191,360
12Jul 8, 2021 19:42115,455107,832,68442,718,22502,195,456