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

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

Challenge History
DateChallengerCostTypeStatus
Jul 5, 2026 00:03Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 00:03010,990,8591,047,0002,173,0002,121,728expected "16384 ", got "349 "stderr
2Jul 5, 2026 00:03010,924,2951,043,0002,148,0002,121,728expected "16384 ", got "349 "stderr
3Jul 5, 2026 00:03010,980,6731,529,0001,529,0002,121,728expected "16384 ", got "349 "stderr
4Jan 2, 2026 08:483,426135,453,201111,073,0002,001,0002,338,816
5Jan 2, 2026 08:483,518137,034,926114,091,0002,001,0002,416,640
6Jan 2, 2026 08:483,642141,661,624118,168,0002,002,0002,506,752