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 11:59zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 5, 2026 00:40Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 00:40011,008,3671,541,0001,542,0002,121,728expected "16384 ", got "349 "stderr
2Jul 5, 2026 00:40011,026,5771,040,0002,208,0002,121,728expected "16384 ", got "349 "stderr
3Jul 5, 2026 00:40011,047,2721,035,0002,078,0002,121,728expected "16384 ", got "349 "stderr
4Jan 2, 2026 11:593,417131,904,794110,770,0001,995,0002,408,448
5Jan 2, 2026 11:593,525135,891,549114,328,0002,005,0002,535,424
6Jan 2, 2026 11:593,530152,263,481116,506,00002,420,736