1. If you are willing to use the "Iverson bracket notation", popularized by Knuth and others, you can say $$C(x) = \sum_{i=1}^n [s_i = x]$$
Here $[\ldots]$ are the Iverson brackets. $[P]$ is defined to be 1 if $P$ is true, and 0 if it is false.
2. People do sometimes use the Kronecker delta for this: $\delta_{ij}$ is defined to be 1 if $i=j$ and 0 if $i\
e j$, so you would have:
$$C(x) = \sum_{i=1}^n \delta_{xs_i}$$ or $$C(x) = \sum_{i=1}^n \delta(x, s_i)$$
but I think the Iverson bracket is more straightforward.
3. Most straightforward would be to write
> Let $C(x)$ be the number of elements of $s_1,\ldots,s_n$ that are equal to $x$. Then…
The idea that this is somehow less "formal" than something involving a bunch of funny symbols is a common misapprehension.