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 4, 2026 21:38zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 4, 2026 23:31Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 4, 2026 23:32011,051,8701,045,0002,197,0002,121,728expected "16384 ", got "770 "stderr
2Jul 4, 2026 23:32011,003,3211,041,0002,148,0002,121,728expected "16384 ", got "770 "stderr
3Jul 4, 2026 23:32010,927,9221,044,0002,145,0002,121,728expected "16384 ", got "770 "stderr
4Jan 4, 2026 21:383,503139,710,711114,579,0001,005,0002,416,640
5Jan 4, 2026 21:383,510138,484,307114,816,000998,0002,412,544
6Jan 4, 2026 21:383,528137,575,261115,406,0001,003,0002,412,544