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 8, 2026 01:20zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 4, 2026 08:04Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 4, 2026 08:04011,066,5911,044,0002,121,0002,121,728expected "16384 ", got "349 "stderr
2Jul 4, 2026 08:04010,796,5541,043,0002,152,0002,121,728expected "16384 ", got "349 "stderr
3Jul 4, 2026 08:04011,171,7941,042,0002,231,0002,121,728expected "16384 ", got "349 "stderr
4Jan 8, 2026 01:203,085132,735,29198,798,0002,993,0002,535,424
5Jan 8, 2026 01:203,166132,503,107102,461,0002,009,0002,416,640
6Jan 8, 2026 01:203,228131,108,705105,525,0001,005,0002,416,640