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 09:10zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 5, 2026 00:54Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 00:55011,048,7511,539,0001,539,0002,121,728expected "16384 ", got "349 "stderr
2Jul 5, 2026 00:55011,193,5601,045,0002,222,0002,121,728expected "16384 ", got "349 "stderr
3Jul 5, 2026 00:55011,069,9861,515,0001,518,0002,121,728expected "16384 ", got "349 "stderr
4Jan 2, 2026 09:103,506145,518,752113,700,0001,994,0002,387,968
5Jan 2, 2026 09:103,536143,651,086115,677,000997,0002,416,640
6Jan 2, 2026 09:103,676143,979,229119,297,0002,004,0002,416,640