Longest Unique Substring

Given a string s, determine the length of the longest substring without repeating characters. This problem tests your understanding of string manipulation and sliding window techniques. Consider the string as a sequence of characters and find the maximum length substring where each character appears only once. Formally, given a string \( s \), find the maximum length \( L \) such that there exists a substring \( s[i \ldots j] \) (with \( j-i+1 = L \)) where all characters are unique.

inputFormat

The input is provided via standard input (stdin) as a single line containing the string \( s \).

outputFormat

The output should be printed to standard output (stdout) as a single integer representing the length of the longest substring with all unique characters.

abcabcbb

3