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 13, 2025 17:40Rajarshi BasuRajarshi BasuScore: 11,478Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 13, 2025 17:4011,448405,817,932348,799,00028,983,0002,412,544
2Dec 13, 2025 17:4011,478407,103,599350,780,00027,982,0002,486,272
3Dec 13, 2025 17:4011,488404,538,172344,094,00035,009,0002,404,352