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 23, 2024 15:06E SequeiraE SequeiraScore: 75,516Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 23, 2024 15:0673,9772,473,214,1892,417,247,00023,982,0002,412,544
2Nov 23, 2024 15:0675,5162,519,908,8732,468,068,00023,971,0002,281,472
3Nov 23, 2024 15:0675,8342,537,391,8722,479,557,00022,968,0002,506,752