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 7, 2026 18:54zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 4, 2026 12:04Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 4, 2026 12:04010,886,2531,043,0002,094,0002,121,728expected "16384 ", got "1056 "stderr
2Jul 4, 2026 12:04011,242,5851,045,0002,125,0002,121,728expected "16384 ", got "1056 "stderr
3Jul 4, 2026 12:04011,045,6081,524,0001,524,0002,121,728expected "16384 ", got "1056 "stderr
4Jan 7, 2026 18:543,205132,037,462104,769,0001,007,0002,535,424
5Jan 7, 2026 18:543,252127,286,974106,311,0001,002,0002,412,544
6Jan 7, 2026 18:543,322140,896,093109,631,00002,408,448