Summary: Let \(G = (V,E)\) be a graph. A total labeling \(\psi : V \bigcup E \rightarrow \{1, 2, \dots, k\}\) is called totally irregular total \(k\)-labeling of \(G\) if every two distinct vertices \(u\) and \(v\) in \(V (G)\) satisfy \(wt(u) \neq wt(v)\), and every two distinct edges \(u_1 u_2\) and \(v_1 v_2\) in \(E(G)\) satisfy \(wt(u_1 u_2) \neq wt(v_1 v_2)\) where \(wt(u) = \psi (u) + \sum_{uv \in E(G)} \psi (uv)\) and \(wt(u_1 u_2) = \psi (u_1) + \psi (u_1u_2) + \psi (u_2)\). The minimum \(k\) for which a graph \(G\) has a totally irregular total \(k\)-labeling is called the total irregularity strength of \(G\), denoted by \(ts(G)\). In this paper, we determine the exact value of the total irregularity strength of cubic graphs.