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 listSep 22, 2024 13:41Alex KentAlex KentScore: 57,843Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 22, 2024 13:4157,7111,929,101,0291,882,459,00021,993,0002,293,760
2Sep 22, 2024 13:4157,8431,932,908,8191,887,824,00020,986,0002,265,088
3Sep 22, 2024 13:4158,4861,962,765,8181,912,042,00017,990,0002,293,760