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 08:47Rajarshi BasuRajarshi BasuScore: 5,256Success
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 08:475,244199,200,446168,051,0005,001,0002,363,392
2Dec 20, 2025 08:475,256199,851,363167,427,0006,015,0002,338,816
3Dec 20, 2025 08:475,834221,725,880185,543,0006,982,0002,514,944