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 10, 2026 18:41zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 4, 2026 14:50Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 4, 2026 14:50010,968,1081,039,0002,165,0002,121,728expected "16384 ", got "349 "stderr
2Jul 4, 2026 14:50011,077,0921,031,0002,091,0002,121,728expected "16384 ", got "349 "stderr
3Jul 4, 2026 14:50010,933,6051,039,0002,082,0002,121,728expected "16384 ", got "349 "stderr
4Jan 10, 2026 18:413,240133,974,784104,919,0001,998,0002,400,256
5Jan 10, 2026 18:413,285130,339,422106,414,0002,007,0002,400,256
6Jan 10, 2026 18:413,297131,648,134107,790,000998,0002,535,424