#include <bits/stdc++.h>
using namespace std;

const int MAXN = 1e5+5;
using ll = long long;

int T;
int n;
char S[MAXN];

int main()
{
    scanf("%d",&T);
    while(T--)
    {
        scanf(" %s",S+1); n = strlen(S+1);
        ll ans = 0;
        for(int i = 1; i <= n; ++i)
        {
            if(i >= 2 && S[i] == S[i-1])
            {
                ans += 1ll * (i-1) * (n-i+1);
            }
            if(S[i] == '0')
            {
                ans += (n-i+1);
            }
            ans += 1ll * i * (n-i+1);
        }
        printf("%lld\n",ans);
    }
    return 0;
}