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 5, 2026 18:39Павел РатмановПавел РатмановScore: 68,869Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 5, 2026 18:3968,1042,277,961,9112,225,453,00021,974,0002,412,544
2Jan 5, 2026 18:3968,8692,309,105,8142,246,743,00025,950,0002,289,664
3Jan 5, 2026 18:3968,9272,315,493,3842,250,627,00023,953,0002,289,664