Unique strings Sergey Svistunov

Count the exact number of unique tokens as fast as possible.

Input

One token per line on STDIN:

JWXcKKaWzvFL5
Rof
3ztCpA
5wHcGN
*UiEMthaTS*g

Output

Print the exact count of unique tokens to STDOUT.

Constraints

  • Character set: 0123456789abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ@#%*
  • Maximum token length: 16
  • Approximately 1,000,000 unique tokens
Back to listDec 22, 2025 10:33Rajarshi BasuRajarshi BasuScore: 4,899Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 22, 2025 10:334,873184,489,166157,818,0002,996,0002,510,848
2Dec 22, 2025 10:334,878187,036,891156,977,0003,999,0002,293,760
3Dec 22, 2025 10:334,887191,400,613156,278,0004,977,0002,445,312
4Dec 22, 2025 10:334,888192,089,985157,308,0004,007,0002,293,760
5Dec 22, 2025 10:334,899187,602,813156,663,0004,989,0002,293,760
6Dec 22, 2025 10:334,901186,048,177157,751,0003,993,0002,510,848
7Dec 22, 2025 10:334,902188,450,049157,771,0003,994,0002,293,760
8Dec 22, 2025 10:334,965189,080,885159,856,0003,996,0002,293,760
9Dec 22, 2025 10:335,035187,678,141162,139,0004,003,0002,523,136