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 20:35Павел РатмановПавел РатмановScore: 92,325Success
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 20:3591,9123,059,212,7023,000,113,00032,979,0002,478,080
2Dec 31, 2025 20:3592,3253,074,854,8613,013,750,00032,986,0002,281,472
3Dec 31, 2025 20:3592,8633,094,212,6693,025,506,00038,980,0002,433,024