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

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

Challenge History
DateChallengerCostTypeStatus
Jul 4, 2026 15:54Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 4, 2026 15:54017,285,6401,263,0002,812,0002,125,824expected "16384 ", got "445 "stderr
2Jul 4, 2026 15:54013,586,4051,336,0002,633,0002,125,824expected "16384 ", got "445 "stderr
3Jul 4, 2026 15:54013,653,7591,347,0002,736,0002,125,824expected "16384 ", got "445 "stderr
4Jan 3, 2026 07:463,280129,615,274104,236,0004,009,0002,453,504
5Jan 3, 2026 07:463,302132,078,504104,972,0003,998,0002,523,136
6Jan 3, 2026 07:463,388137,849,993107,799,0003,992,0002,297,856