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 26, 2023 10:47Yurkov AlekseyYurkov AlekseyScore: 110,003Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 26, 2023 10:4798,54098,022,91636,459,70402,265,088
2Mar 26, 2023 10:4798,892119,710,64036,590,02202,269,184
3Mar 26, 2023 10:47100,788120,082,34437,291,49202,269,184
4Mar 26, 2023 10:47109,28464,497,04739,425,0001,010,0002,289,664
5Mar 26, 2023 10:47109,66573,362,63839,562,0001,014,0002,289,664
6Mar 26, 2023 10:47109,86865,591,10439,635,0001,016,0002,289,664
7Mar 26, 2023 10:47110,00366,816,07639,684,0001,017,0002,273,280
8Mar 26, 2023 10:47110,41470,458,63038,861,0001,992,0002,289,664
9Mar 26, 2023 10:47110,42767,689,88638,865,0001,993,0002,273,280
10Mar 26, 2023 10:47110,46267,230,35538,878,0001,993,0002,269,184
11Mar 26, 2023 10:47110,53065,364,15038,902,0001,994,0002,273,280
12Mar 26, 2023 10:47110,81465,321,92339,001,0002,000,0002,289,664