Longest Substring Without Repeating Characters

Given a string s, find the length of the longest substring without repeating characters.

This problem requires you to implement an algorithm that efficiently determines the longest substring containing unique characters by using techniques such as the sliding window method. Specifically, if we denote by \( s[i:j] \) a substring of \( s \) from index \( i \) to \( j-1 \), we want to find the maximum \( j-i \) such that all characters in \( s[i:j] \) are distinct. The desired algorithm should run in linear time.

Note: The input is provided via standard input (stdin) and the output should be printed to standard output (stdout).

inputFormat

The input consists of a single line containing the string s. The string can include letters, digits, and other ASCII characters.

outputFormat

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

0