Because it is a single-node map, the value of the SHARD_COUNT cannot be particularly large, so it is easy to randomly transfer a large number of keys to a slot, which means that the shard lock map function may be invalid
Sharding can be achieved using a prioritized queue, and then each time the map with the smallest queue length is taken and put into the element