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 20, 2025 07:27Aniruddha DebAniruddha DebScore: 493,042Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 20, 2025 07:27486,41816,084,258,18715,954,834,00096,944,0002,338,816
2Jul 20, 2025 07:27493,04216,308,907,64016,167,439,000102,932,0002,277,376
3Jul 20, 2025 07:27496,22516,419,855,65316,272,496,000102,927,0002,404,352