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:36Павел РатмановПавел РатмановScore: 92,758Success
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:3692,4533,083,767,8283,015,988,00034,976,0002,330,624
2Dec 31, 2025 20:3692,7583,088,652,9383,025,050,00035,976,0002,330,624
3Dec 31, 2025 20:3693,6433,118,320,8383,051,228,00038,977,0002,281,472