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 14:16zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 4, 2026 11:06Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 4, 2026 11:07011,010,5501,543,0001,542,0002,121,728expected "16384 ", got "1056 "stderr
2Jul 4, 2026 11:07011,319,0671,048,0002,198,0002,121,728expected "16384 ", got "1056 "stderr
3Jul 4, 2026 11:07010,961,6001,047,0002,207,0002,121,728expected "16384 ", got "1056 "stderr
4Jan 7, 2026 14:163,150131,469,443102,935,000999,0002,400,256
5Jan 7, 2026 14:163,217129,262,997104,165,0002,003,0002,408,448
6Jan 7, 2026 14:163,302133,507,404107,965,000999,0002,404,352