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 listMay 28, 2023 19:57АндрейАндрейScore: 85,961Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 28, 2023 19:5785,5772,903,181,0802,824,040,56102,306,048
2May 28, 2023 19:5985,6472,888,507,3272,826,367,07002,314,240
3May 28, 2023 19:5985,8402,893,840,3172,832,704,66902,306,048
4May 28, 2023 19:5785,9612,903,971,2792,836,719,41502,314,240
5May 28, 2023 19:5986,0452,918,099,4332,839,494,32902,314,240
6May 28, 2023 19:5786,4322,907,627,8932,852,239,77302,187,264