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 3, 2026 05:49Rajarshi BasuRajarshi BasuError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 4, 2026 16:31Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 4, 2026 16:32012,862,56303,456,0002,117,632expected "16384 ", got "445 "
2Jul 4, 2026 16:32014,064,72903,145,0002,117,632expected "16384 ", got "445 "
3Jul 4, 2026 16:32012,811,89703,482,0002,117,632expected "16384 ", got "445 "
4Jan 3, 2026 05:493,217129,180,019103,154,0003,004,0002,285,568
5Jan 3, 2026 05:493,319135,089,932108,520,0001,004,0002,285,568
6Jan 3, 2026 05:493,630139,413,314117,797,0001,996,0002,387,968