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 22:41zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 5, 2026 14:31Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 14:31010,720,0831,584,0001,584,0002,117,632expected "16384 ", got "32 "
2Jul 5, 2026 14:31011,025,7331,601,0001,601,0002,117,632expected "16384 ", got "32 "
3Jul 5, 2026 14:31010,963,4721,578,0001,578,0002,117,632expected "16384 ", got "32 "
4Dec 22, 2025 22:414,261168,454,281132,641,0007,978,0002,494,464
5Dec 22, 2025 22:414,277167,973,303130,128,00011,010,0002,396,160
6Dec 22, 2025 22:414,306169,365,427132,097,00010,007,0002,375,680