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:27Павел РатмановПавел РатмановScore: 97,043Success
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:2796,5923,220,824,1223,042,696,000144,842,0002,478,080
2Dec 31, 2025 15:2797,0433,229,059,7653,055,597,000146,836,0002,285,568
3Dec 31, 2025 15:2797,1663,237,905,9203,069,628,000136,849,0002,285,568