A collection of solutions to challenges posted on https://reddit.com/r/dailyprogrammer
No more hiding from your alarm clock! You've decided you want your computer to keep you updated on the time so you're never late again. A talking clock takes a 24-hour time and translates it into words.
Uses the inflect package to convert numbers to words.
Your program must collect packets from stdin, assemble them in the correct order, and print the completed messages to stdout.
The point of reading from stdin is to simulate incoming packets. For the purposes of this challenge, assume there is a potentially unlimited number of packets. Your program should not depend on knowing how many packets there are in total. Simply sorting the input in its entirety would technically work, but defeats the purpose of this exercise.
This is my first attempt at a dailyprogrammer challenge. I based it on a help comment posted in the thread.