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

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

Challenge History
DateChallengerCostTypeStatus
Jul 4, 2026 21:25Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 4, 2026 21:26012,898,23403,421,0002,117,632expected "16384 ", got "574 "
2Jul 4, 2026 21:26014,151,41903,262,0002,117,632expected "16384 ", got "574 "
3Jul 4, 2026 21:26012,889,02003,484,0002,117,632expected "16384 ", got "574 "
4Jan 2, 2026 12:093,427140,587,527111,081,0002,001,0002,285,568
5Jan 2, 2026 12:093,447141,472,730112,756,0001,006,0002,387,968
6Jan 2, 2026 12:093,498143,615,024112,422,0003,011,0002,285,568