The time will depend on the size of the object.
Consider the following function that does some multiplication, addition and comparison of integers:
min200(T) = minimum(x*x+x for x in UnitRange{T}(1:200))
Here are the times using BenchmarkTools:
julia> @btime min200(Int16);
9.409 ns (0 allocations: 0 bytes)
julia> @btime min200(Int32);
14.329 ns (0 allocations: 0 bytes)
julia> @btime min200(Int64);
47.267 ns (0 allocations: 0 bytes)
julia> @btime min200(Int128);
256.160 ns (0 allocations: 0 bytes)
Note that this difference goes down to the assembly code. Let us see how an addition of two integer number gets compiled.
julia> @code_native +(Int32(5), Int32(7))
.text
; ┌ @ int.jl:87 within `+`
pushq %rbp
movq %rsp, %rbp
leal (%rcx,%rdx), %eax
popq %rbp
retq
nopl (%rax)
; └
julia> @code_native +(5,7)
.text
; ┌ @ int.jl:87 within `+`
pushq %rbp
movq %rsp, %rbp
leaq (%rcx,%rdx), %rax
popq %rbp
retq
nopw (%rax,%rax)
; └
You can see that the 32-bit addition used 32-bit registry %eax vs 64-bit %rax in the second code.
Moreover, when you using features such as @simd or GPU computing via CuArrays those differences might turn out to be even more significant.