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 3, 2026 05:43Rajarshi BasuRajarshi BasuError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 4, 2026 16:01Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 4, 2026 16:02015,186,00803,743,0002,125,824expected "16384 ", got "445 "stderr
2Jul 4, 2026 16:02013,590,7711,393,0002,688,0002,125,824expected "16384 ", got "445 "stderr
3Jul 4, 2026 16:02013,642,3511,410,0002,774,0002,125,824expected "16384 ", got "445 "stderr
4Jan 3, 2026 05:433,276133,326,185104,116,0004,004,0002,514,944
5Jan 3, 2026 05:433,303132,780,494105,005,0004,000,0002,445,312
6Jan 3, 2026 05:433,308134,178,910105,160,0004,006,0002,510,848