1 ! Copyright (c) 2007, 2008 Aaron Schaefer.
2 ! See https://factorcode.org/license.txt for BSD license.
3 USING: ascii kernel ranges math.text.english sequences
7 ! https://projecteuler.net/problem=17
12 ! If the numbers 1 to 5 are written out in words: one, two,
13 ! three, four, five; there are 3 + 3 + 5 + 4 + 4 = 19 letters
16 ! If all the numbers from 1 to 1000 (one thousand) inclusive
17 ! were written out in words, how many letters would be used?
19 ! NOTE: Do not count spaces or hyphens. For example, 342 (three
20 ! hundred and forty-two) contains 23 letters and 115 (one
21 ! hundred and fifteen) contains 20 letters.
27 : euler017 ( -- answer )
28 1000 [1..b] SBUF" " clone [ number>text append! ] reduce
31 ! [ euler017 ] 100 ave-time
32 ! 15 ms ave run time - 1.71 SD (100 trials)