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 2, 2025 07:25korsajankorsajanScore: 105,248Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 2, 2025 07:25104,2063,467,483,8603,396,844,00041,961,0002,457,600
2Feb 2, 2025 07:25104,5613,480,945,4433,399,557,00050,963,0002,379,776
3Feb 2, 2025 07:25104,9523,495,746,9633,416,428,00046,978,0002,412,544
4Feb 2, 2025 07:25105,2323,499,532,6313,416,679,00055,961,0002,330,624
5Feb 2, 2025 07:25105,2483,509,071,9073,433,211,00039,979,0002,465,792
6Feb 2, 2025 07:25105,2743,507,183,3513,435,056,00038,977,0002,523,136
7Feb 2, 2025 07:25105,2773,504,080,4263,436,169,00037,979,0002,330,624
8Feb 2, 2025 07:25105,4423,509,566,4893,452,605,00026,981,0002,330,624
9Feb 2, 2025 07:25105,4723,507,130,4123,440,595,00039,972,0002,330,624