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 listMar 23, 2025 15:38Aniruddha DebAniruddha DebScore: 22,466Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 23, 2025 15:3822,217755,922,008723,169,00010,002,0002,347,008
2Mar 23, 2025 15:3822,245760,169,927724,096,00010,001,0002,351,104
3Mar 23, 2025 15:3822,371766,796,829727,254,00011,003,0002,523,136
4Mar 23, 2025 15:3822,459768,563,724727,142,00014,002,0002,301,952
5Mar 23, 2025 15:3822,466767,819,959729,384,00011,989,0002,510,848
6Mar 23, 2025 15:3822,594768,451,733736,593,0008,995,0002,465,792
7Mar 23, 2025 15:3823,095790,757,341752,142,0009,988,0002,408,448
8Mar 23, 2025 15:3823,179790,721,377752,920,00011,998,0002,301,952
9Mar 23, 2025 15:3823,258795,262,621755,536,00011,992,0002,461,696