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 2, 2026 23:27zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 4, 2026 14:49Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 4, 2026 14:49011,006,9291,535,0001,534,0002,121,728expected "16384 ", got "396 "stderr
2Jul 4, 2026 14:49011,113,7991,547,0001,547,0002,121,728expected "16384 ", got "396 "stderr
3Jul 4, 2026 14:49010,989,8381,040,0002,201,0002,121,728expected "16384 ", got "396 "stderr
4Jan 2, 2026 23:273,183128,474,116103,049,0002,000,0002,502,656
5Jan 2, 2026 23:273,276129,951,230106,105,0002,001,0002,273,280
6Jan 2, 2026 23:273,319139,507,810107,513,0002,009,0002,416,640