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 9, 2026 00:52zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 5, 2026 07:06Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 07:06010,808,4021,542,0001,543,0002,121,728expected "16384 ", got "348 "stderr
2Jul 5, 2026 07:06010,797,2441,527,0001,528,0002,121,728expected "16384 ", got "348 "stderr
3Jul 5, 2026 07:06010,887,9281,045,0002,204,0002,121,728expected "16384 ", got "348 "stderr
4Jan 9, 2026 00:523,631141,690,579116,826,0002,995,0002,428,928
5Jan 9, 2026 00:523,692145,254,299120,831,000998,0002,535,424
6Jan 9, 2026 00:523,923153,856,826127,444,0002,006,0002,535,424