#include <bits/stdc++.h>
using namespace std;
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<ll, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
*/

typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef map<int, int> mii;
typedef unordered_map<int, int> umii;
typedef map<ll, ll> mll;
typedef unordered_map<ll, ll> umll;
template <class T> using PQMax = priority_queue<T>;
template <class T> using PQMin = priority_queue<T, vector<T>, greater<T>>;
template <class T1, class T2>
void maximize(T1 &a, T2 b){
    if (b > a) a = b;
}
template <class T1, class T2>
void minimize(T1 &a, T2 b){
    if (b < a) a = b;
}
template <class T>
void read(T &number)
{
    bool negative = false;
    register int c;
    number = 0;
    c = getchar();
    while (c != '-' && !isalnum(c)) c = getchar();
    if (c=='-'){
        negative = true;
        c = getchar();
    }
    for (; (c>47 && c<58); c=getchar())
        number = number *10 + c - 48;
    if (negative)
        number *= -1;
}
template <class T, class ...Ts>
void read(T &a, Ts& ... args){
    read(a);
    read(args...);
}

/*
struct Node
{
    int node, len;
    Node() {node = len = 0;}
    Node(int node, int len) {this -> node = node, this -> len = len;}
};
typedef vector<Node> vg;
*/

#define MAX 1000001
#define MOD 1000000007

#define fi first
#define se second
#define pf push_front
#define pb push_back

#define FOR(type, i, a, b) for(type i = (a); i <= (b); i++)
#define FORD(type, i, b, a) for(type i = (b); i >= (a); i--)

#define testBit(n, bit) (((n) >> (bit)) & 1)
#define flipBit(n, bit) ((n) ^ (1ll << (bit)))
#define cntBit(n) __builtin_popcount(n)
#define cntBitll(n) __builtin_popcountll(n)
#define randomize mt19937_64 mt(chrono::steady_clock::now().time_since_epoch().count());

ll t;
string s;
ll n;
ll sum[MAX];
ll sumPref[MAX];

inline ll getSum(ll l, ll r){
    return (r - l + 1) * (l + r) / 2;
}

main()
{
    ios_base::sync_with_stdio(0); cin.tie(0);
    cin >> t;
    FOR(ll, _, 1, t){
        cin >> s; n = s.length(); s = ' ' + s;
        for (ll i = 1; i <= n; i++)
            sum[i] = sum[i - 1] + (s[i] == s[i - 1]),
            sumPref[i] = sumPref[i - 1] + sum[i];

        // for (ll i = 1; i <= n; i++) cerr << sum[i] << " \n"[i == n];
        // for (ll i = 1; i <= n; i++) cerr << sumPref[i] << " \n"[i == n];
        
        ll answer = 0;
        for (ll p = 0; p < n; p++){
            answer += (n-p)*(n-p+1)/2 + (n - p) * (s[p + 1] == '0');
            answer += sumPref[n] - sumPref[p+1] - (n-(p+1)) * sum[p+1];
            // cerr << answer << " \n"[p == n - 1];
        }

        cout << answer << '\n';
    }
}