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 19, 2025 09:26Rajarshi BasuRajarshi BasuScore: 6,381Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 19, 2025 09:266,346236,511,333205,423,0004,008,0002,277,376
2Dec 19, 2025 09:266,361238,268,191204,905,0004,997,0002,428,928
3Dec 19, 2025 09:266,371241,564,533203,230,0007,007,0002,387,968
4Dec 19, 2025 09:266,377240,745,581204,416,0006,012,0002,392,064
5Dec 19, 2025 09:266,381234,059,349199,588,00010,977,0002,498,560
6Dec 19, 2025 09:266,410236,653,011204,542,0006,984,0002,359,296
7Dec 19, 2025 09:266,421235,309,138204,886,0006,996,0002,482,176
8Dec 19, 2025 09:266,437244,228,665202,446,0009,972,0002,469,888
9Dec 19, 2025 09:266,558248,011,078209,449,0006,981,0002,519,040