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 21:14Aman | अमनAman | अमनScore: 321,608Success
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 21:14321,04110,632,022,65710,560,362,00033,978,0002,519,040
2Dec 30, 2025 21:14321,60810,653,358,64410,580,089,00032,981,0002,375,680
3Dec 30, 2025 21:14324,38510,741,714,54410,677,735,00026,981,0002,297,856