Longest Substring Without Repeating Characters

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

Formally, you are given a string \( s \) and you need to compute the maximum length \( L \) such that there exists a substring of \( s \) of length \( L \) where every character is unique. For example, given \( s = "abcabcbb" \), the longest substring without repeating characters is "abc", so \( L = 3 \).

Input will be provided via standard input and output via standard output.

inputFormat

A single string \( s \) given on one line representing the input. The string can contain letters, digits, and special characters.

outputFormat

An integer representing the length of the longest substring without repeating characters.

abcabcbb

3