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 08:03Rajarshi BasuRajarshi BasuScore: 5,891Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 22, 2025 08:035,837218,947,271186,619,0005,987,0002,396,160
2Dec 22, 2025 08:025,879217,203,850189,006,0005,000,0002,486,272
3Dec 22, 2025 08:025,883217,275,422188,134,0006,004,0002,326,528
4Dec 22, 2025 08:035,891227,556,984190,404,0003,987,0002,289,664
5Dec 22, 2025 08:025,894220,668,698189,512,0004,987,0002,510,848
6Dec 22, 2025 08:035,897224,225,108186,613,0007,983,0002,506,752