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 22, 2025 14:47Rajarshi BasuRajarshi BasuError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 5, 2026 15:01Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 15:02014,089,82103,069,0002,121,728expected "16384 ", got "1373 "
2Jul 5, 2026 15:02013,069,58303,717,0002,121,728expected "16384 ", got "1373 "
3Jul 5, 2026 15:02012,737,75303,312,0002,117,632expected "16384 ", got "1373 "
4Dec 22, 2025 14:474,849186,113,889157,011,0003,000,0002,383,872
5Dec 22, 2025 14:474,854182,288,823158,195,0002,002,0002,281,472
6Dec 22, 2025 14:474,914182,629,715159,160,0003,003,0002,285,568