Given an integer array nums, return the bitwise $ ext{OR}$ of the sum of every possible subsequence of nums.

A subsequence is a sequence that can be derived from an array by deleting zero or more elements without changing the order of the remaining elements.

Note: The sum of an empty subsequence is defined as $0$.

Constraints:

• $1 \leq$ nums.length $\leq 10^5$

• $0 \leq$ nums[i] $\leq 10^9$

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.