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 27, 2023 09:49matsuoka-601matsuoka-601Score: 7,158Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 27, 2023 09:497,128308,219,956235,231,32202,289,664
2Aug 27, 2023 12:307,133307,037,959235,401,93802,297,856
3Aug 27, 2023 12:307,153294,796,083236,037,13902,289,664
4Aug 27, 2023 09:497,158292,458,254236,201,03202,306,048
5Aug 27, 2023 12:307,163315,331,419236,386,14002,310,144
6Aug 27, 2023 09:497,164327,997,398236,398,35502,281,472