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 29, 2025 20:00zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 5, 2026 04:30Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 04:30021,121,7135,327,0007,775,0002,121,728expected "16384 ", got "786 "stderr
2Jul 5, 2026 04:30021,041,8755,454,0007,553,0002,121,728expected "16384 ", got "786 "stderr
3Jul 5, 2026 04:30021,143,8785,313,0007,731,0002,121,728expected "16384 ", got "786 "stderr
4Dec 29, 2025 20:003,628145,347,292109,761,0009,978,0002,449,408
5Dec 29, 2025 20:003,629140,990,632110,771,0008,981,0002,285,568
6Dec 29, 2025 20:003,737150,417,773115,307,0008,021,0002,400,256