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 listJan 5, 2026 14:24Павел РатмановПавел РатмановScore: 167,176Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 5, 2026 14:20159,6625,300,941,3115,241,885,00026,973,0002,285,568
2Jan 5, 2026 14:20164,6455,472,930,1885,404,316,00028,964,0002,387,968
3Jan 5, 2026 14:24166,8615,534,540,0195,473,422,00032,978,000204,800
4Jan 5, 2026 14:24167,1765,546,296,9315,484,834,00031,975,000188,416
5Jan 5, 2026 14:24167,6265,561,213,4725,502,668,00028,977,000188,416
6Jan 5, 2026 14:20181,2716,037,842,1985,948,044,00033,903,0002,285,568