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 23, 2021 04:16evgenikwtevgenikwtScore: 61,770Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 23, 2021 04:1658,4142,004,674,1441,927,657,16602,248,704
2May 23, 2021 04:3258,9662,007,366,6581,945,874,95702,240,512
3May 23, 2021 04:3261,2842,079,557,3142,022,372,01202,244,608
4May 23, 2021 04:3261,7702,090,645,1552,038,405,83402,256,896
5May 23, 2021 04:1661,8102,093,576,0152,039,735,53102,252,800
6May 23, 2021 04:1661,8502,103,461,7932,041,037,13602,224,128