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 14, 2022 10:05Dmitry IvanovDmitry IvanovScore: 426,732Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 14, 2022 10:05425,58314,110,343,97414,044,234,52102,199,552
2Jul 14, 2022 10:05426,73214,156,551,62314,082,147,60302,236,416
3Jul 14, 2022 10:05428,63614,215,424,77014,145,000,26902,203,648