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 listJun 20, 2021 18:48Andrey TsvetkovAndrey TsvetkovScore: 84,620Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 20, 2021 18:4884,5192,842,876,5462,789,134,30902,248,704
2Jun 20, 2021 18:4884,6202,865,036,1332,792,444,51502,244,608
3Jun 20, 2021 18:4885,0802,888,389,7882,807,651,89802,260,992