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

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

Challenge History
DateChallengerCostTypeStatus
Jul 4, 2026 17:38Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 4, 2026 17:38014,196,65803,210,0002,117,632expected "16384 ", got "445 "
2Jul 4, 2026 17:38014,240,66303,321,0002,117,632expected "16384 ", got "445 "
3Jul 4, 2026 17:38012,797,46603,424,0002,117,632expected "16384 ", got "445 "
4Jan 3, 2026 07:143,226135,831,105104,462,0002,008,0002,469,888
5Jan 3, 2026 07:143,341133,303,972107,242,0003,006,0002,285,568
6Jan 3, 2026 07:143,486140,580,741112,035,0003,000,0002,285,568