Longest Substring Without Repeating Characters

Given a string s, your task is to compute the length of the longest substring that contains no repeating characters.

This problem requires you to efficiently determine the maximal length of a substring where all characters are unique. You can solve this problem using the sliding window technique. Make sure your solution reads from standard input (stdin) and writes the result to standard output (stdout).

inputFormat

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

outputFormat

Output a single integer representing the length of the longest substring of s that does not contain any repeating characters.

abcabcbb

3