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 14, 2025 14:02Rajarshi BasuRajarshi BasuScore: 8,352Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 14, 2025 14:028,348300,178,720268,509,0006,987,0002,502,656
2Dec 14, 2025 14:028,352301,716,778268,621,0006,990,0002,514,944
3Dec 14, 2025 14:028,992324,621,597290,730,0005,994,0002,506,752