Longest Substring Without Repeating Characters

Given a string s with length \(n\), your task is to compute the length of the longest substring without any repeating characters.

A substring is a contiguous sequence of characters within the string. For example, if \(s = \texttt{abcabcbb}\), the longest substring without repeating characters is \(abc\), with a length of 3.

Note that characters are case-sensitive and special characters are allowed.

inputFormat

The input is provided via standard input (stdin). It contains a single line representing the string \(s\) (\(1 \leq |s| \leq 10^5\)).

outputFormat

Print a single integer representing the length of the longest substring of \(s\) that contains no repeated characters. The output should be written to standard output (stdout).

abcabcbb

3