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 listOct 11, 2024 07:23Vladimir TatVladimir TatScore: 312,930Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 11, 2024 07:23311,98310,334,414,81510,265,452,00029,980,0002,310,144
2Oct 11, 2024 07:23312,93010,362,447,25410,288,715,00037,976,0002,367,488
3Oct 11, 2024 07:23313,25310,365,429,13810,308,367,00028,984,0002,510,848