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 listJan 4, 2026 21:28Павел РатмановПавел РатмановScore: 67,194Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 4, 2026 21:2866,8322,239,868,2262,183,460,00021,984,0002,375,680
2Jan 4, 2026 21:2867,1942,252,768,4202,195,425,00021,984,0002,396,160
3Jan 4, 2026 21:2868,8552,303,719,2222,252,217,00019,993,0002,289,664