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 6, 2026 09:57Rajarshi BasuRajarshi BasuError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 4, 2026 14:52Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 4, 2026 14:52015,599,1231,226,0002,560,0002,125,824expected "16384 ", got "445 "stderr
2Jul 4, 2026 14:52013,646,5311,363,0002,686,0002,125,824expected "16384 ", got "445 "stderr
3Jul 4, 2026 14:52013,957,6831,342,0002,935,0002,125,824expected "16384 ", got "445 "stderr
4Jan 6, 2026 09:573,291129,798,824104,626,0003,985,0002,379,776
5Jan 6, 2026 09:573,294138,226,348104,728,0003,989,0002,297,856
6Jan 6, 2026 09:573,298134,151,681104,833,0003,993,0002,510,848