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 13:20Ilya AniskovetsIlya AniskovetsScore: 47,401Success
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 13:2047,0791,611,677,0891,553,602,40102,232,320
2Sep 2, 2021 13:2047,4011,629,772,7881,564,219,25702,277,376
3Sep 2, 2021 13:2048,0341,653,982,1371,585,119,69502,289,664