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 listDec 23, 2025 10:49zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 5, 2026 14:36Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 14:37011,180,2781,708,0001,707,0002,121,728expected "16384 ", got "32 "stderr
2Jul 5, 2026 14:37011,102,4491,659,0001,659,0002,121,728expected "16384 ", got "32 "stderr
3Jul 5, 2026 14:37010,937,3361,600,0001,600,0002,121,728expected "16384 ", got "32 "stderr
4Dec 23, 2025 10:494,287169,241,600129,433,00012,040,0002,400,256
5Dec 23, 2025 10:494,307163,082,088130,130,00012,012,0002,412,544
6Dec 23, 2025 10:494,581176,801,266137,161,00014,016,0002,506,752