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 2, 2026 12:31Rajarshi BasuRajarshi BasuError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 4, 2026 18:51Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 4, 2026 18:51014,419,56303,222,0002,117,632expected "16384 ", got "445 "
2Jul 4, 2026 18:51012,993,04003,562,0002,117,632expected "16384 ", got "445 "
3Jul 4, 2026 18:51012,803,78403,410,0002,117,632expected "16384 ", got "445 "
4Jan 2, 2026 12:313,376138,527,884108,390,0003,010,0002,383,872
5Jan 2, 2026 12:313,392133,752,587109,923,0001,998,0002,392,064
6Jan 2, 2026 12:313,395135,352,205109,050,0003,001,0002,285,568