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 18:11zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 5, 2026 13:38Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 13:39010,960,0641,573,0001,572,0002,121,728expected "16384 ", got "32 "stderr
2Jul 5, 2026 13:39010,956,1791,572,0001,572,0002,121,728expected "16384 ", got "32 "stderr
3Jul 5, 2026 13:39011,144,8801,704,0001,704,0002,121,728expected "16384 ", got "32 "stderr
4Dec 23, 2025 18:114,055157,416,649120,838,00012,982,0002,355,200
5Dec 23, 2025 18:114,071159,209,346124,392,0009,951,0002,334,720
6Dec 23, 2025 18:114,081156,800,603123,689,00010,972,0002,400,256