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 17:02zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 4, 2026 20:41Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 4, 2026 20:41011,001,7041,529,0001,528,0002,121,728expected "16384 ", got "349 "stderr
2Jul 4, 2026 20:41010,937,7661,541,0001,542,0002,121,728expected "16384 ", got "349 "stderr
3Jul 4, 2026 20:41010,841,3741,522,0001,522,0002,121,728expected "16384 ", got "349 "stderr
4Jan 2, 2026 17:023,356136,065,809109,749,0001,006,0002,273,280
5Jan 2, 2026 17:023,426138,464,896111,069,0002,001,0002,535,424
6Jan 2, 2026 17:023,447143,056,845112,768,000997,0002,420,736