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 23, 2025 08:56Cameron AavikCameron AavikScore: 31,452Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 23, 2025 08:5631,1871,063,079,594971,205,00057,952,0002,433,024
2Jan 23, 2025 08:5631,2081,062,063,735967,865,00061,991,0002,289,664
3Jan 23, 2025 08:5631,3311,061,418,817976,925,00056,995,0002,375,680
4Jan 23, 2025 08:5631,4121,066,254,372965,624,00070,972,0002,289,664
5Jan 23, 2025 08:5631,4521,066,945,899975,977,00061,935,0002,293,760
6Jan 23, 2025 08:5631,5061,074,226,847981,725,00057,983,0002,441,216
7Jan 23, 2025 08:5631,5431,068,997,377982,981,00057,939,0002,408,448
8Jan 23, 2025 08:5631,5961,072,776,749988,678,00053,982,0002,293,760
9Jan 23, 2025 08:5631,6131,074,710,998993,268,00049,963,0002,293,760