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 3, 2026 10:45zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 4, 2026 16:16Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 4, 2026 16:16011,388,3921,092,0002,299,0002,121,728expected "16384 ", got "349 "stderr
2Jul 4, 2026 16:16011,466,5471,101,0002,366,0002,121,728expected "16384 ", got "349 "stderr
3Jul 4, 2026 16:16011,422,9091,099,0002,427,0002,121,728expected "16384 ", got "349 "stderr
4Jan 3, 2026 10:453,285127,948,003105,384,0003,010,0002,273,280
5Jan 3, 2026 10:453,309127,439,804107,191,0002,003,0002,416,640
6Jan 3, 2026 10:453,338132,813,197107,155,0003,004,0002,412,544