Distributed Sum Computation with Minimal Communication Cost

microsoft Given a set of machines, each containing an integer. The communication cost between these machines is high. Design an algorithm to calculate the total sum of integers across all machines with minimal time cost. Example Input 3 5 7 3