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 18, 2021 21:53alex3dalex3dScore: 56,579Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 18, 2021 21:5856,5251,925,807,0181,865,323,10202,195,456
2Jun 18, 2021 21:5356,5581,921,852,6261,866,424,35702,297,856
3Jun 18, 2021 21:5856,5631,934,786,1211,866,581,14802,310,144
4Jun 18, 2021 21:5356,5791,927,598,8231,867,103,02802,195,456
5Jun 18, 2021 21:5856,6431,921,436,6401,869,227,02002,220,032
6Jun 18, 2021 21:5356,6651,930,468,0951,869,958,64002,256,896