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 1, 2026 17:48zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 5, 2026 06:06Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 06:07011,463,8701,044,0002,272,0002,121,728expected "16384 ", got "349 "stderr
2Jul 5, 2026 06:07011,086,3971,044,0002,236,0002,121,728expected "16384 ", got "349 "stderr
3Jul 5, 2026 06:07011,299,1871,044,0002,194,0002,121,728expected "16384 ", got "349 "stderr
4Jan 1, 2026 17:483,557143,526,195115,370,0002,006,0002,420,736
5Jan 1, 2026 17:483,659146,454,202118,743,0001,995,0002,412,544
6Jan 1, 2026 17:483,670149,698,613118,121,0003,003,0002,420,736