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 25, 2025 22:55zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 5, 2026 12:30Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 12:31011,721,4062,647,0001,323,0002,121,728expected "16384 ", got "353 "stderr
2Jul 5, 2026 12:31011,699,7412,652,0001,326,0002,121,728expected "16384 ", got "353 "stderr
3Jul 5, 2026 12:31011,556,2422,524,0001,261,0002,121,728expected "16384 ", got "353 "stderr
4Dec 25, 2025 22:553,942150,893,836121,072,0009,005,0002,383,872
5Dec 25, 2025 22:553,982161,450,397123,378,0008,024,0002,392,064
6Dec 25, 2025 22:554,024154,999,137124,819,0007,988,0002,396,160