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 listAug 5, 2022 09:36Eugene ZhydzetskiEugene ZhydzetskiScore: 108,415Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 5, 2022 09:36107,4613,608,166,9583,546,207,54702,248,704
2Aug 5, 2022 09:36108,4153,642,479,7783,577,705,56802,326,528
3Aug 5, 2022 09:36108,8653,646,186,7343,592,543,07402,240,512