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 25, 2025 23:04zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 5, 2026 11:20Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 11:20011,782,5272,659,0001,329,0002,121,728expected "16384 ", got "349 "stderr
2Jul 5, 2026 11:20011,838,9612,662,0001,329,0002,121,728expected "16384 ", got "349 "stderr
3Jul 5, 2026 11:20011,726,3772,641,0001,320,0002,121,728expected "16384 ", got "349 "stderr
4Dec 25, 2025 23:043,877154,043,731117,932,0009,994,0002,355,200
5Dec 25, 2025 23:043,887146,776,351120,258,0008,017,0002,408,448
6Dec 25, 2025 23:043,891152,117,585122,392,0006,019,0002,502,656