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 4, 2026 23:38zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 4, 2026 09:50Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 4, 2026 09:51010,957,2511,524,0001,524,0002,121,728expected "16384 ", got "349 "stderr
2Jul 4, 2026 09:51011,007,5091,540,0001,541,0002,121,728expected "16384 ", got "349 "stderr
3Jul 4, 2026 09:51011,421,7001,042,0002,288,0002,121,728expected "16384 ", got "349 "stderr
4Jan 4, 2026 23:383,145132,187,018102,786,000997,0002,408,448
5Jan 4, 2026 23:383,192125,277,293103,336,0002,006,0002,408,448
6Jan 4, 2026 23:383,241127,531,470104,968,0001,999,0002,531,328