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:38Radek SzymanskiRadek SzymanskiScore: 179,823Success
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:38178,7405,973,840,2495,898,412,70302,277,376
2Jul 5, 2023 21:38179,8235,994,933,4815,934,145,58902,256,896
3Jul 5, 2023 21:38180,8546,048,773,9665,968,186,56202,195,456