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 listFeb 26, 2025 17:11AdityaAdityaScore: 104,909Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 26, 2025 17:11104,2083,468,139,3363,401,896,00036,977,0002,371,584
2Feb 26, 2025 17:11104,3503,475,231,0183,405,563,00037,972,0002,371,584
3Feb 26, 2025 17:11104,5033,483,751,6903,413,623,00034,975,0002,371,584
4Feb 26, 2025 17:11104,6313,484,116,8253,407,855,00044,971,0002,371,584
5Feb 26, 2025 17:11104,9093,494,719,7363,428,031,00033,980,0002,371,584
6Feb 26, 2025 17:11104,9633,494,258,7803,417,795,00045,970,0002,519,040
7Feb 26, 2025 17:11105,0073,501,833,2433,424,242,00040,978,0002,371,584
8Feb 26, 2025 17:11105,0113,497,121,4123,430,385,00034,973,0002,519,040
9Feb 26, 2025 17:11106,4843,541,574,6403,474,005,00039,965,0002,523,136