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 20:49zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 4, 2026 06:43Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 4, 2026 06:43010,933,7861,527,0001,527,0002,121,728expected "16384 ", got "349 "stderr
2Jul 4, 2026 06:43010,865,4391,042,0002,119,0002,121,728expected "16384 ", got "349 "stderr
3Jul 4, 2026 06:43010,952,9021,525,0001,525,0002,121,728expected "16384 ", got "349 "stderr
4Jan 10, 2026 20:493,145130,091,881101,803,0001,996,0002,416,640
5Jan 10, 2026 20:493,150126,869,568101,957,0001,999,0002,416,640
6Jan 10, 2026 20:493,256133,134,174106,444,0001,004,0002,535,424