Horizontal graph of word length Input

A list of words separated by any number of spaces.

Output

A horizontal ASCII art graph, where the n-th line is composed by as many asterisks (*) as the n-th word is long.

Example usage

The &gt; signals user input, you should not input it when testing the program.

&gt; This is an example histogram of word length
****
**
**
*******
*********
**
****
******




&gt; a aa aaa aaaa aaaaa
*
**
***
****
*****




&gt; double space  example
******
*****
*******


Reference implementation

In case of doubt over the specification, the output of your program should match exactly that of the below program under all inputs.

puts gets.chomp.split.map{|word| '*' * word.length}.join("\n")
Retina, 5 + 3 = 8 bytes

 +
\n
.
*


Every line goes in its own file, so I've added 1 byte for each additional file. Also, the \n should be replaced with an actual newline.

Each pair of lines is a pattern-replacement pair.  + matches one or more spaces and replaces it with a newline. . matches any character except a newline, and it replaces that with a *. This is applied globally, so every character is replaced with a *.