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 16:33zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 5, 2026 08:50Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 08:50010,990,2261,536,0001,536,0002,121,728expected "16384 ", got "349 "stderr
2Jul 5, 2026 08:50010,820,6351,041,0002,087,0002,121,728expected "16384 ", got "349 "stderr
3Jul 5, 2026 08:50011,035,9611,044,0002,195,0002,121,728expected "16384 ", got "349 "stderr
4Jan 1, 2026 16:333,758146,157,521122,005,0002,000,0002,416,640
5Jan 1, 2026 16:333,760148,814,444122,071,0002,001,0002,408,448
6Jan 1, 2026 16:333,794149,128,695124,186,0001,001,0002,412,544