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 listNov 14, 2025 22:12izotoffizotoffScore: 134,329Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 14, 2025 22:12133,5104,442,587,1534,393,829,00011,994,0002,330,624
2Nov 14, 2025 22:12134,3294,459,976,9714,410,850,00021,994,0002,457,600
3Nov 14, 2025 22:12134,3604,466,748,5564,409,885,00023,983,0002,330,624