Simple recursive Fibonaci example. How to make it faster?

Hello,

what could I do to get the program up and running? I only get error messages like this.

march=pentium4 ? i don’t have this shit old feet warmer from 2000 :mask: :slight_smile:

the module looks like this

module Fib

fib(n, a=0, b=1) = n > 0 ? fib(n-1, b, a+b) : a

Base.@ccallable function julia_main(ARGS::Vector{String})::Cint
    @show fib(10)
    return 0
end

end # module