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 3, 2021 04:39Ilya AniskovetsIlya AniskovetsScore: 41,869Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 3, 2021 04:3941,4741,435,872,3741,368,656,44402,293,760
2Sep 3, 2021 04:3941,8691,443,713,4551,381,687,40102,273,280
3Sep 3, 2021 04:3941,9581,438,865,9761,384,601,34702,211,840