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 1, 2026 23:00zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 5, 2026 14:01Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 14:01019,414,2724,251,0007,219,0002,121,728expected "16384 ", got "786 "stderr
2Jul 5, 2026 14:01019,193,7704,274,0007,051,0002,121,728expected "16384 ", got "786 "stderr
3Jul 5, 2026 14:01019,399,8654,252,0007,121,0002,121,728expected "16384 ", got "786 "stderr
4Jan 1, 2026 23:004,091159,066,730127,008,0008,000,0002,334,720
5Jan 1, 2026 23:004,096156,133,673126,142,0009,010,0002,342,912
6Jan 1, 2026 23:004,126162,323,829129,143,0007,007,0002,347,008