Can a Fibonacci function be written to execute in O(1) time?

Given arbitrary large inputs, simply reading in n takes O(log n), so in that sense no constant time algorithm is possible. But printing (or even storing) the output is O(n), no matter what number base you use.