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 listDec 30, 2025 17:46zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 5, 2026 06:14Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 06:14021,334,1175,392,0007,988,0002,121,728expected "16384 ", got "786 "stderr
2Jul 5, 2026 06:14020,952,1735,377,0007,618,0002,121,728expected "16384 ", got "786 "stderr
3Jul 5, 2026 06:14021,727,6415,458,0007,974,0002,121,728expected "16384 ", got "786 "stderr
4Dec 30, 2025 17:463,629140,111,772109,781,0009,980,0002,514,944
5Dec 30, 2025 17:463,663141,237,485115,889,0004,995,0002,338,816
6Dec 30, 2025 17:463,712150,054,411115,472,0007,028,0002,281,472