Longest Unique Substring Length

Given a string \(s\), your task is to determine the length of the longest contiguous substring that contains all unique characters. In other words, find the maximum value of \(L = j - i + 1\) over all substrings \(s[i \ldots j]\) where each character is distinct.

The input is provided as a single line from standard input, and the output should be the integer representing the maximum length found.

inputFormat

A single line containing the string (s). The string may consist of any characters.

outputFormat

An integer representing the length of the longest contiguous substring with all unique characters.## sample

abcabcbb

3