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 2, 2026 12:44Rajarshi BasuRajarshi BasuError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 4, 2026 16:39Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 4, 2026 16:39014,425,37203,222,0002,117,632expected "16384 ", got "445 "
2Jul 4, 2026 16:39012,746,28003,433,0002,117,632expected "16384 ", got "445 "
3Jul 4, 2026 16:39012,716,16103,450,0002,117,632expected "16384 ", got "445 "
4Jan 2, 2026 12:443,298131,711,497105,852,0002,995,0002,285,568
5Jan 2, 2026 12:443,325137,296,466106,749,0002,992,0002,392,064
6Jan 2, 2026 12:443,414139,699,766110,654,0001,993,0002,367,488