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 5, 2023 21:40Radek SzymanskiRadek SzymanskiScore: 178,507Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2023 21:40177,5465,927,296,6515,859,023,78402,256,896
2Jul 5, 2023 21:40178,5075,957,303,4335,890,741,48502,236,416
3Jul 5, 2023 21:40179,4825,994,547,3195,922,903,27602,220,032