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 listApr 15, 2024 04:41E SequeiraE SequeiraScore: 480,003Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 15, 2024 04:41478,36315,851,663,57315,785,982,73602,203,648
2Apr 15, 2024 04:41480,00315,895,887,81215,840,096,02002,248,704
3Apr 15, 2024 04:41481,76315,965,841,97115,898,182,56802,293,760