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 20, 2025 15:23Rajarshi BasuRajarshi BasuScore: 5,230Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 20, 2025 15:245,071192,994,019162,329,0005,010,0002,383,872
2Dec 20, 2025 15:235,076197,031,268159,531,0007,976,0002,301,952
3Dec 20, 2025 15:245,218193,133,453166,180,0006,006,0002,486,272
4Dec 20, 2025 15:235,230201,391,459166,595,0005,985,0002,506,752
5Dec 20, 2025 15:235,247204,409,330168,157,0005,004,0002,510,848
6Dec 20, 2025 15:245,505211,150,289177,662,0003,992,0002,523,136