Longest Substring Without Repeating Characters

This problem requires you to find the length of the longest substring in a given string s that does not contain any repeated characters. The comparison is case sensitive; in other words, characters such as 'a' and 'A' are considered distinct.

Problem Statement: Given a string s, determine the length of the longest substring without repeating characters. A substring is a contiguous sequence of characters within a string.

Example:
Input: abcabcbb
Output: 3
Explanation: The answer is "abc", with the length of 3.

The solution should read input from standard input and output the result to standard output.

inputFormat

The input consists of a single line containing the string s. The string may contain letters, digits, special characters and spaces. Note that the input is taken from standard input (stdin).

outputFormat

Output a single integer: the length of the longest substring without repeating characters. The result should be written to standard output (stdout).

0