Consecutive Number Sum

Given an array of integers `sequence`, determine the length of the longest consecutive sequence of numbers that sum to a given target `t`. Input: - The first line contains an integer n (1 ≤ n ≤ 10^5), the number of elements in the array. - The second line contains n space-separated integers, representing the elements of the array (-10^4 ≤ sequence[i] ≤ 10^4). - The third line contains an integer t (1 ≤ t ≤ 10^5), the target sum. Output: - An integer representing the length of the longest consecutive sequence that sums to `t`. Example: Input: 5 1 2 3 4 5 7 Output: 3