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

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

Challenge History
DateChallengerCostTypeStatus
Jul 5, 2026 04:08Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 04:08011,016,8541,045,0002,166,0002,121,728expected "16384 ", got "349 "stderr
2Jul 5, 2026 04:08010,957,8741,044,0002,140,0002,121,728expected "16384 ", got "349 "stderr
3Jul 5, 2026 04:08011,351,3701,043,0002,223,0002,121,728expected "16384 ", got "349 "stderr
4Jan 1, 2026 18:033,514141,487,738113,979,0001,999,0002,424,832
5Jan 1, 2026 18:033,617140,057,530118,362,0001,003,0002,273,280
6Jan 1, 2026 18:033,879151,733,752126,011,0002,000,0002,535,424