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 listSep 2, 2021 09:17Ilya AniskovetsIlya AniskovetsScore: 127,634Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 2, 2021 09:17127,1074,256,169,2254,194,530,98102,252,800
2Sep 2, 2021 09:15127,2294,273,994,2254,198,548,95302,297,856
3Sep 2, 2021 09:15127,5394,274,763,9004,208,794,22302,215,936
4Sep 2, 2021 09:17127,6344,270,667,4474,211,913,88002,224,128
5Sep 2, 2021 09:15128,4574,301,147,7234,239,070,87902,215,936
6Sep 2, 2021 09:17130,4824,374,702,8524,305,902,12302,277,376