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 2, 2026 20:46zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 4, 2026 17:45Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 4, 2026 17:45010,933,1811,042,0002,173,0002,121,728expected "16384 ", got "349 "stderr
2Jul 4, 2026 17:45011,217,5491,043,0002,210,0002,121,728expected "16384 ", got "349 "stderr
3Jul 4, 2026 17:45010,990,9321,040,0002,184,0002,121,728expected "16384 ", got "349 "stderr
4Jan 2, 2026 20:473,186127,660,464103,121,0002,002,0002,404,352
5Jan 2, 2026 20:473,240135,649,080103,922,0002,997,0002,494,464
6Jan 2, 2026 20:473,318134,789,554108,499,0001,004,0002,416,640
7Jan 2, 2026 20:463,347136,503,781108,443,0002,008,0002,420,736
8Jan 2, 2026 20:463,468137,967,869113,428,0001,003,0002,269,184
9Jan 2, 2026 20:463,501139,928,519115,535,00002,412,544