It won't matter to any worthwhile mixed-integer linear programming (MILP, also known as MIP) solver if you keep or omit the integral constraints, as long as your constraint matrix is truly totally unimodular.
To be on the safe side, keep the integral constraints and call your MILP solver. Any solver utilizing a branch-and-bound or branch-and-cut framework should start by solving the linear programming (LP) relaxation of your ILP, in which case, it will omit the integral constraints. Since your constraint matrix is totally unimodular, an optimal solution of the LP relaxation should be satisfy the integral constraint because the polytope those constraints define consists of vertices with integer coordinates. Since the solution to the relaxation satisfies the integral constraints, the MILP solver will stop and return the solution obtained from the LP relaxation with little to no additional overhead beyond calling the LP solver (which is what you would have done if you just solved the LP relaxation).