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 31, 2025 19:55Павел РатмановПавел РатмановScore: 72,739Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 31, 2025 19:5571,5432,389,717,1392,336,917,00023,988,0002,396,160
2Dec 31, 2025 19:5572,7392,430,290,6382,379,392,00020,985,0002,281,472
3Dec 31, 2025 19:5573,8422,470,388,5602,418,799,00017,991,0002,289,664