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 1, 2026 16:17zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 5, 2026 08:27Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 08:27011,453,4351,090,0002,537,0002,121,728expected "16384 ", got "349 "stderr
2Jul 5, 2026 08:27011,236,3201,089,0002,504,0002,121,728expected "16384 ", got "349 "stderr
3Jul 5, 2026 08:27011,555,9151,089,0002,500,0002,121,728expected "16384 ", got "349 "stderr
4Jan 1, 2026 16:173,708147,231,788119,368,0003,009,0002,424,832
5Jan 1, 2026 16:173,736150,270,597119,279,0004,009,0002,416,640
6Jan 1, 2026 16:173,883153,319,104126,147,0002,002,0002,420,736