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 30, 2025 08:32Rajarshi BasuRajarshi BasuScore: 4,884Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 30, 2025 08:324,870183,634,395157,710,0002,994,0002,281,472
2Dec 30, 2025 08:324,884185,886,320158,167,0003,003,0002,277,376
3Dec 30, 2025 08:324,902184,922,515158,766,0002,995,0002,281,472