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 20, 2025 15:24Rajarshi BasuRajarshi BasuScore: 5,103Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 20, 2025 15:245,041192,304,440162,361,0004,008,0002,510,848
2Dec 20, 2025 15:245,070191,231,706162,317,0005,009,0002,510,848
3Dec 20, 2025 15:245,071189,331,908162,319,0005,009,0002,519,040
4Dec 20, 2025 15:245,096195,294,255164,162,0004,003,0002,473,984
5Dec 20, 2025 15:245,103196,999,751162,390,0006,014,0002,363,392
6Dec 20, 2025 15:245,130194,941,138162,263,0007,011,0002,387,968
7Dec 20, 2025 15:245,241200,719,786170,966,0001,999,0002,519,040
8Dec 20, 2025 15:245,281203,577,537167,276,0007,011,0002,412,544
9Dec 20, 2025 15:245,746215,130,936184,639,0004,990,0002,502,656