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

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

Challenge History
DateChallengerCostTypeStatus
Jul 5, 2026 04:01Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 04:01011,084,5201,042,0002,177,0002,121,728expected "16384 ", got "349 "stderr
2Jul 5, 2026 04:01011,001,8621,542,0001,542,0002,121,728expected "16384 ", got "349 "stderr
3Jul 5, 2026 04:01011,005,1041,042,0002,193,0002,121,728expected "16384 ", got "349 "stderr
4Jan 1, 2026 20:183,496146,476,491115,363,00002,408,448
5Jan 1, 2026 20:183,613147,458,901117,215,0002,003,0002,273,280
6Jan 1, 2026 20:183,627149,655,309117,685,0001,994,0002,273,280