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 26, 2025 01:20Josu San MartinJosu San MartinScore: 46,557Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 26, 2025 01:2046,4181,561,871,1061,410,974,000120,826,0002,510,848
2Dec 26, 2025 01:2046,5571,564,317,6731,395,530,000140,851,0002,310,144
3Dec 26, 2025 01:2046,6471,562,871,6491,383,524,000155,833,0002,441,216