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 21:36Yurkov AlekseyYurkov AlekseyScore: 105,032Success
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 21:36103,23266,309,89136,186,0002,010,0002,289,664
2Jul 8, 2021 21:36104,14362,958,04437,519,0001,014,0002,289,664
3Jul 8, 2021 21:36104,15460,955,59538,537,00002,527,232
4Jul 8, 2021 21:36104,51966,049,05637,655,0001,017,0002,269,184
5Jul 8, 2021 21:36104,61661,097,76437,716,000992,0002,289,664
6Jul 8, 2021 21:36104,96866,045,18537,843,000995,0002,367,488
7Jul 8, 2021 21:36105,03264,828,07038,862,00002,289,664
8Jul 8, 2021 21:36105,31465,376,53636,968,0001,998,0002,269,184
9Jul 8, 2021 21:36105,82266,275,93238,151,0001,003,0002,289,664
10Jul 8, 2021 21:36132,257103,441,08848,934,94902,265,088
11Jul 8, 2021 21:36133,320107,109,62349,328,23802,273,280
12Jul 8, 2021 21:36145,456118,608,65753,818,83202,281,472