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 12, 2025 19:37Leon ZhaoLeon ZhaoScore: 26,780Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 12, 2025 19:3726,500897,746,260818,536,00055,968,0002,486,272
2Aug 12, 2025 19:3726,780913,196,765827,811,00055,919,0002,379,776
3Aug 12, 2025 19:3728,786975,833,439909,979,00039,955,0002,379,776