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 15:47zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 5, 2026 05:14Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 05:1509,705,80202,065,0002,121,728expected "16384 ", got "349 "stderr
2Jul 5, 2026 05:1509,818,06502,036,0002,121,728expected "16384 ", got "349 "stderr
3Jul 5, 2026 05:1509,825,79901,882,0002,121,728expected "16384 ", got "349 "stderr
4Jan 1, 2026 15:473,627147,153,137116,715,0002,992,0002,424,832
5Jan 1, 2026 15:473,644148,531,656116,257,0004,008,0002,433,024
6Jan 1, 2026 15:473,678143,984,301118,351,0003,008,0002,408,448