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 16:03art-intart-intScore: 314,663Success
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 16:03312,51410,360,555,16910,168,079,000144,887,0002,416,640
2Jan 23, 2025 16:03313,35810,376,165,08310,212,930,000127,898,0002,359,296
3Jan 23, 2025 16:03313,97510,404,373,15610,237,264,000123,906,0002,506,752
4Jan 23, 2025 16:03314,43410,412,454,36210,239,450,000136,885,0002,457,600
5Jan 23, 2025 16:03314,66310,414,751,35710,264,969,000118,895,0002,478,080
6Jan 23, 2025 16:03314,98510,429,936,70510,267,585,000126,908,0002,506,752
7Jan 23, 2025 16:03317,04410,502,667,33410,323,567,000138,886,0002,482,176
8Jan 23, 2025 16:03317,61710,521,766,90610,354,476,000126,895,0002,338,816
9Jan 23, 2025 16:03317,64510,518,867,92310,345,415,000136,886,0002,408,448