Longest Substring Without Repeating Characters

Given a string \(s\), determine the length of the longest substring that does not contain any repeating characters. For instance, if \(s = "abcabcbb"\), then the longest substring without repeating characters is "abc" which has a length of 3. Solve this problem by reading a string from standard input and outputting the result to standard output.

inputFormat

The input consists of a single line containing the string \(s\). The string may include letters, digits, and special characters.

outputFormat

Output a single integer representing the length of the longest substring without repeating characters.

0