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:48Павел РатмановПавел РатмановScore: 81,878Success
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:4881,5862,721,038,4162,671,349,00020,987,0002,281,472
2Dec 31, 2025 19:4881,8782,731,704,1492,681,985,00019,992,0002,281,472
3Dec 31, 2025 19:4882,1922,738,782,2582,689,353,00022,985,0002,281,472