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 listJan 21, 2025 13:21Cameron AavikCameron AavikScore: 31,911Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 21, 2025 13:2131,6671,069,241,556975,072,00069,933,0002,293,760
2Jan 21, 2025 13:2131,6971,077,223,832974,079,00071,932,0002,433,024
3Jan 21, 2025 13:2131,8541,074,709,480988,245,00062,951,0002,445,312
4Jan 21, 2025 13:2131,9091,080,745,830983,006,00070,000,0002,375,680
5Jan 21, 2025 13:2131,9111,088,493,091990,114,00062,943,0002,387,968
6Jan 21, 2025 13:2131,9511,079,529,840990,423,00063,962,0002,539,520
7Jan 21, 2025 13:2132,0381,081,945,644994,305,00062,956,0002,306,048
8Jan 21, 2025 13:2132,0561,087,280,925986,929,00070,923,0002,424,832
9Jan 21, 2025 13:2132,2271,093,378,043998,532,00064,969,0002,424,832