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 03:45Rajarshi BasuRajarshi BasuError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 4, 2026 18:14Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 4, 2026 18:14015,722,8861,261,0002,682,0002,125,824expected "16384 ", got "445 "stderr
2Jul 4, 2026 18:14015,028,4041,442,0002,785,0002,125,824expected "16384 ", got "445 "stderr
3Jul 4, 2026 18:14014,210,5901,449,0002,803,0002,125,824expected "16384 ", got "445 "stderr
4Jan 3, 2026 03:453,369134,258,086107,167,0004,006,0002,506,752
5Jan 3, 2026 03:453,373133,558,664107,304,0004,011,0002,514,944
6Jan 3, 2026 03:453,474146,262,923111,664,0002,991,0002,297,856