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 9, 2023 13:16Mikhail SolovevMikhail SolovevScore: 208,556Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 9, 2023 13:16206,9176,895,507,8686,828,271,03002,232,320
2Aug 9, 2023 13:16208,5566,941,726,0086,882,362,71602,244,608
3Aug 9, 2023 13:16209,8127,020,327,0276,923,803,59602,215,936