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 18:00zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 4, 2026 14:45Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 4, 2026 14:45011,010,1301,537,0001,538,0002,121,728expected "16384 ", got "349 "stderr
2Jul 4, 2026 14:45011,201,3661,032,0002,088,0002,121,728expected "16384 ", got "349 "stderr
3Jul 4, 2026 14:45010,933,2341,045,0002,127,0002,121,728expected "16384 ", got "349 "stderr
4Jan 4, 2026 18:003,247130,245,357104,150,0003,004,0002,416,640
5Jan 4, 2026 18:003,268125,768,062104,854,0002,995,0002,412,544
6Jan 4, 2026 18:003,337138,216,200108,109,0002,002,0002,420,736