No, you cannot put any better bound than SN = o(N). There is a general technique, using the Baire category theorem of proving the existence of counterexamples to problems like this (which I discovered while trying to find a counterexample to a question by David Speyer, link). I see that Helge's answer is also pointing towards the same result.
First, for θ irrational, $$ S_N/N=\frac{1}{N}\sum_{n=1}^N1_{\{0< n\theta/2 <1/2{\rm\ (mod\ 1)}\}}-\frac{1}{N}\sum_{n=1}^N1_{\{1/2< n\theta/2 <1{\rm\ (mod\ 1)}\}} $$ By Weyl's equidistribution theorem, both sides on the right hand side tend to 1/2 and SN / N → 0, so SN = o(N).
It is not possible to do better than this. In fact, if f: ℕ → ℝ+ is any function satisfying liminf f(N) / N = 0 then there will be an uncountable dense set of irrational θ for which limsup SN / f(N) = ∞. In particular, using f(n) = nx for x < 1 rules out bounds such as Sn = O(nx). In fact, we can find a set of such θ as an intersection of countably many open dense subsets of ℝ, so the Baire category theorem shows the existence of uncountably many counterexamples.
Let u(x) = 1{0≤[x/2]<1/2} - 1{1/2≤[x/2]<1} where [x] is the fractional part of x, and SN(θ) = Σn≤N u(nθ). Let UK be the set $$ U_K=\left\{\theta\in\mathbb{R}\colon S_n(\theta)>Kf(n){\rm\ for\ some\ }n\ge K\right\}. $$ This contains a dense open subset of ℝ. In fact, if θ = 2p/q for q odd then, for 1 ≤ n < q, u((q-n)θ) = -u(nθ). So, Sq-1(θ) = 0 and Sq(θ) = 1. Then, by periodicity of [nθ/2], Snq (θ) = n and Sn(θ) increases linearly. So, Sn(θ) > Kf(n) for infinitely many n, and θ ∈ UK. By right continuity of u, (θ,θ+ε) ⊆ UK for small enough ε. This shows that (2p/q,2p/q+ε) is contained in the interior of UK and, as such 2p/q are dense, the interior of UK is a dense open subset of ℝ. The Baire category theorem implies that $$ U\equiv\bigcap_{K=1}^\infty U_K $$ is an uncountable dense subset of ℝ and, by construction, for any θ ∈ U, limsup Sn(θ) / f(n) > K for each K.