What's wrong with the code?

Decided to take naive implementation of factorial in Racket and Lisp:

	#lang racket
	(define (factorial n)
	(define (i_factorial n acc)
	(if (= 0 n)
	acc
	(i_factorial (- n 1) (* n acc))))
	(i_factorial n 1))
	(map (lambda (n)
	(printf "~a~n" (factorial n))) (list 1 12 123 1234 12345))

view raw factorial.rkt hosted with ❤ by GitHub

and

	(defun factorial (n)
	(defun i_factorial (n acc)
	(if (= 0 n)
	acc
	(i_factorial (- n 1) (* acc n))))
	(i_factorial n 1))
	(defun print-factorial (n)
	(format T "~D~%" (factorial n)))
	(mapcar 'print-factorial '(1 12 123 1234 12345))

view raw factorial.lisp hosted with ❤ by GitHub

And even after

raco exe test.rkt

timing is as follows:

raco exe test.rkt
time ./test

real 0m0.697s
user 0m0.581s
sys 0m0.092s

time sbcl --script test.lisp

real 0m0.139s
user 0m0.085s
sys 0m0.049s

Maybe I/O in Racket is rather slow?