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 21:08zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 5, 2026 02:54Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 02:54011,309,5741,045,0002,179,0002,121,728expected "16384 ", got "349 "stderr
2Jul 5, 2026 02:54011,294,8901,046,0002,176,0002,121,728expected "16384 ", got "349 "stderr
3Jul 5, 2026 02:54010,985,1691,545,0001,544,0002,121,728expected "16384 ", got "349 "stderr
4Jan 1, 2026 21:083,464139,333,935113,308,0001,002,0002,506,752
5Jan 1, 2026 21:083,579147,658,891116,094,0002,001,0002,412,544
6Jan 1, 2026 21:083,615143,575,317116,287,0003,007,0002,416,640