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 20, 2025 23:57izotoffizotoffScore: 104,762Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 20, 2025 23:57102,5443,411,974,3903,372,953,00010,993,0002,330,624
2Nov 20, 2025 23:57104,7623,486,849,4803,443,169,00013,984,0002,330,624
3Nov 20, 2025 23:57108,2273,596,435,7633,561,512,0009,993,0002,330,624