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 listJul 25, 2022 21:01deniskolsanovdeniskolsanovScore: 62,916Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 25, 2022 21:0162,4242,126,729,4952,059,980,80202,269,184
2Jul 25, 2022 21:0162,9162,155,301,3442,076,221,61802,269,184
3Jul 25, 2022 21:0163,1772,173,388,1472,084,837,15702,265,088