Design an algorithm to process millions of array updates per second. What would you do?

Use segment trees or Fenwick trees.

Efficient update/query structures reduce operations from O(n) to O(log n), making them suitable for high-frequency updates.