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 08:58zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 4, 2026 22:17Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 4, 2026 22:17011,094,8141,544,0001,544,0002,121,728expected "16384 ", got "349 "stderr
2Jul 4, 2026 22:17010,985,2861,528,0001,528,0002,121,728expected "16384 ", got "349 "stderr
3Jul 4, 2026 22:17011,034,2441,517,0001,517,0002,121,728expected "16384 ", got "349 "stderr
4Jan 2, 2026 08:583,451135,373,430110,873,0002,996,0002,502,656
5Jan 2, 2026 08:583,484139,828,227112,962,0001,999,0002,506,752
6Jan 2, 2026 08:583,508137,926,870113,756,0001,995,0002,359,296