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 listMar 25, 2023 20:37Yurkov AlekseyYurkov AlekseyScore: 98,959Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 25, 2023 20:3797,70565,131,53934,143,0002,008,0002,289,664
2Mar 25, 2023 20:3797,90053,989,59034,211,0002,012,0002,285,568
3Mar 25, 2023 20:3798,40557,517,64735,399,0001,011,0002,392,064
4Mar 25, 2023 20:3798,63563,491,76235,482,0001,013,0002,277,376
5Mar 25, 2023 20:3798,65465,288,77635,489,0001,013,0002,289,664
6Mar 25, 2023 20:3798,68962,600,63935,501,0001,014,0002,527,232
7Mar 25, 2023 20:3798,95963,092,50535,598,0001,017,0002,523,136
8Mar 25, 2023 20:3799,01963,375,19135,620,0001,017,0002,289,664
9Mar 25, 2023 20:3799,56861,593,38935,845,000995,0002,269,184
10Mar 25, 2023 20:3799,602105,852,89836,852,86402,252,800
11Mar 25, 2023 20:37100,213101,350,26037,078,88602,269,184
12Mar 25, 2023 20:37100,386107,407,89637,142,81702,269,184