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

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

Challenge History
DateChallengerCostTypeStatus
Jul 4, 2026 18:58Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 4, 2026 18:58015,042,2281,200,0002,615,0002,125,824expected "16384 ", got "445 "stderr
2Jul 4, 2026 18:58014,353,5101,445,0002,942,0002,125,824expected "16384 ", got "445 "stderr
3Jul 4, 2026 18:58013,704,9291,341,0002,774,0002,125,824expected "16384 ", got "445 "stderr
4Jan 3, 2026 05:323,290135,052,935104,550,0004,021,0002,523,136
5Jan 3, 2026 05:323,393133,531,463107,975,0003,999,0002,510,848
6Jan 3, 2026 05:323,399137,994,383108,149,0004,005,0002,506,752