Longest Unique Prefix Finder

Given a list of words, implement a function that finds the longest unique prefix for each word that differentiates it from all other words. A prefix is unique if it's not a prefix of any other word in the list. If no unique prefix exists for a word, return an empty string for it. Input is given as a newline-separated list of words. Output should be a newline-separated list of longest unique prefixes corresponding to the input words. Example: Input: apple ape bat batman grapes Output: app bat batm g