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 21:39zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 4, 2026 19:13Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 4, 2026 19:13011,170,7951,047,0002,150,0002,121,728expected "16384 ", got "770 "stderr
2Jul 4, 2026 19:13010,958,2881,044,0002,164,0002,121,728expected "16384 ", got "770 "stderr
3Jul 4, 2026 19:13010,980,7261,525,0001,525,0002,121,728expected "16384 ", got "770 "stderr
4Jan 4, 2026 21:393,368129,309,787109,147,0002,002,0002,408,448
5Jan 4, 2026 21:393,400132,779,312109,191,0003,005,0002,408,448
6Jan 4, 2026 21:393,464139,178,475112,298,0002,005,0002,416,640