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 00:29Vasily TitskiyVasily TitskiyScore: 232,410Success
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 00:29231,0457,686,686,4707,624,497,28102,203,648
2May 23, 2021 00:27231,8407,717,622,9947,650,733,54502,260,992
3May 23, 2021 00:27232,0537,724,770,6877,657,746,33202,301,952
4May 23, 2021 00:29232,4107,745,404,8487,669,538,09002,277,376
5May 23, 2021 00:29234,2157,787,225,5017,729,083,79102,256,896
6May 23, 2021 00:27234,4507,787,601,3097,736,858,50002,170,880