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

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

Challenge History
DateChallengerCostTypeStatus
Jul 4, 2026 07:57Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 4, 2026 07:57011,084,1341,048,0002,124,0002,121,728expected "16384 ", got "1056 "stderr
2Jul 4, 2026 07:57010,987,7041,047,0002,119,0002,121,728expected "16384 ", got "1056 "stderr
3Jul 4, 2026 07:57010,988,7521,532,0001,533,0002,121,728expected "16384 ", got "1056 "stderr
4Jan 7, 2026 13:553,160134,742,333102,280,0002,005,0002,400,256
5Jan 7, 2026 13:553,166123,186,120103,490,0001,004,0002,416,640
6Jan 7, 2026 13:553,331129,886,388107,932,0001,998,0002,502,656