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:26Rajarshi BasuRajarshi BasuScore: 5,094Success
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:265,033188,799,958161,084,0005,002,0002,502,656
2Dec 20, 2025 15:265,060188,767,654162,996,0003,999,0002,326,528
3Dec 20, 2025 15:265,079189,927,479160,615,0006,983,0002,269,184
4Dec 20, 2025 15:265,088195,053,450160,899,0006,995,0002,519,040
5Dec 20, 2025 15:265,094196,353,298162,088,0006,003,0002,437,120
6Dec 20, 2025 15:265,101198,574,367164,341,0004,008,0002,523,136
7Dec 20, 2025 15:265,122195,311,862164,040,0005,001,0002,301,952
8Dec 20, 2025 15:265,238201,470,139169,866,0002,997,0002,519,040
9Dec 20, 2025 15:265,270197,679,933168,926,0004,997,0002,342,912