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 18:03zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 5, 2026 01:16Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 01:17010,949,8981,046,0002,183,0002,121,728expected "16384 ", got "349 "stderr
2Jul 5, 2026 01:17011,056,6701,030,0002,085,0002,121,728expected "16384 ", got "349 "stderr
3Jul 5, 2026 01:17011,003,9931,042,0002,174,0002,121,728expected "16384 ", got "349 "stderr
4Jan 1, 2026 18:033,466136,088,192113,390,0001,003,0002,416,640
5Jan 1, 2026 18:033,540136,362,341114,824,0001,996,0002,416,640
6Jan 1, 2026 18:033,659146,274,730119,742,000997,0002,420,736