Longest Substring Without Repeating Characters

You are given a string s. Your task is to compute the length of the longest substring that does not contain any repeating characters.

For example, if s = "abcabcbb", the longest substring without repeating characters is "abc", so the answer is 3.

Note: A substring is a contiguous sequence of characters within the string.

The solution should read the input from standard input (stdin) and write the output to standard output (stdout).

inputFormat

The input consists of a single line which contains the string s. The string may contain letters, numbers, symbols, and spaces. An empty string is also allowed.

outputFormat

Output a single integer, which is the length of the longest substring without repeating characters.

abcabcbb

3