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 11, 2026 00:08zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 4, 2026 07:27Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 4, 2026 07:27010,996,6791,509,0001,509,0002,121,728expected "16384 ", got "349 "stderr
2Jul 4, 2026 07:27010,933,2171,501,0001,502,0002,121,728expected "16384 ", got "349 "stderr
3Jul 4, 2026 07:27014,786,6131,040,0002,132,0002,121,728expected "16384 ", got "349 "stderr
4Jan 11, 2026 00:083,115128,437,220100,803,0001,996,0002,535,424
5Jan 11, 2026 00:083,159123,747,856103,236,0001,002,0002,412,544
6Jan 11, 2026 00:083,187129,590,041103,168,0002,003,0002,408,448