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 listDec 23, 2025 10:18zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 5, 2026 14:39Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 14:39011,066,4081,655,0001,654,0002,121,728expected "16384 ", got "32 "stderr
2Jul 5, 2026 14:39011,098,0891,674,0001,673,0002,121,728expected "16384 ", got "32 "stderr
3Jul 5, 2026 14:39010,847,5271,575,0001,574,0002,121,728expected "16384 ", got "32 "stderr
4Dec 23, 2025 10:184,307165,222,987132,121,00010,009,0002,297,856
5Dec 23, 2025 10:184,338168,585,502133,129,00010,009,0002,306,048
6Dec 23, 2025 10:184,356168,195,926135,751,0007,985,0002,371,584