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 5, 2026 13:06zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 5, 2026 02:24Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 02:24011,315,5241,093,0002,497,0002,121,728expected "16384 ", got "349 "stderr
2Jul 5, 2026 02:24011,298,0151,094,0002,459,0002,121,728expected "16384 ", got "349 "stderr
3Jul 5, 2026 02:24011,460,3121,095,0002,420,0002,121,728expected "16384 ", got "349 "stderr
4Jan 5, 2026 13:063,527141,391,456113,369,0003,009,0002,416,640
5Jan 5, 2026 13:063,569144,833,432116,784,000989,0002,531,328
6Jan 5, 2026 13:063,905154,027,541124,856,0003,995,0002,412,544