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 21, 2025 05:23Rajarshi 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 21, 2025 05:235,054196,261,114160,775,0005,991,0002,330,624
2Dec 21, 2025 05:235,057193,674,114161,886,0004,996,0002,514,944
3Dec 21, 2025 05:235,067196,524,046160,213,0007,009,0002,514,944
4Dec 21, 2025 05:235,094193,038,612163,106,0005,003,0002,514,944
5Dec 21, 2025 05:235,103195,172,312163,387,0005,011,0002,510,848
6Dec 21, 2025 05:235,122193,501,340164,012,0005,000,0002,514,944
7Dec 21, 2025 05:235,263197,740,302166,700,0006,987,0002,502,656
8Dec 21, 2025 05:235,288200,660,251169,525,0004,986,0002,478,080
9Dec 21, 2025 05:235,309203,940,128170,201,0005,005,0002,478,080