[racket] map/reduce in racket list

There is a task to  count the ten most offen occoured words in a text
file(about 300M), since the excuting time is the most important issue, I
want to  use divide-conquer algorithm(maybe the file is not so big, but I
need to make the program run as fast as possible).
Is the map/reduce in racket suitable to deal with this problem? the test
machine has 8 cores and Linux system.
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://lists.racket-lang.org/users/archive/attachments/20130812/0a24dd4f/attachment.html>