Binary Segments With Target Sum

You are given an array nums consisting exclusively of zeros and ones (a binary array), along with an integer goal representing a target sum. Your task is to determine the total count of non-empty contiguous segments (subarrays) within the array whose elements add up exactly to the specified goal.

A contiguous segment is defined as a sequence of consecutive elements from the array. Note that segments can overlap, and each valid segment should be counted separately even if different segments contain the same elements at different positions.

The challenge lies in efficiently counting all such segments, especially when the array is large. A naive approach of checking every possible segment would be too slow for larger inputs, so consider techniques like prefix sums combined with hash tables, or the sliding window approach for optimal performance.