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 15:24Павел РатмановПавел РатмановScore: 96,983Success
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 15:2496,7183,217,856,1643,052,833,000138,855,0002,453,504
2Dec 31, 2025 15:2496,9833,229,441,7143,066,573,000133,850,0002,281,472
3Dec 31, 2025 15:2497,2843,241,312,6973,072,524,000137,844,0002,281,472