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 14:09Ilya AniskovetsIlya AniskovetsScore: 41,826Success
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 14:0941,7101,442,692,8321,376,429,91402,244,608
2Sep 2, 2021 14:0941,8261,446,470,8721,380,257,42602,265,088
3Sep 2, 2021 14:0942,1101,461,241,8871,389,614,98102,203,648