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 09:04Cameron AavikCameron AavikScore: 28,905Success
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 09:0428,801981,359,348899,454,00050,969,0002,367,488
2Jan 23, 2025 09:0428,819974,266,754892,094,00058,940,0002,289,664
3Jan 23, 2025 09:0428,872983,288,507894,798,00057,986,0002,437,120
4Jan 23, 2025 09:0428,881983,533,958891,129,00061,939,0002,289,664
5Jan 23, 2025 09:0428,905978,338,705899,865,00053,991,0002,289,664
6Jan 23, 2025 09:0429,064989,075,617893,164,00065,938,0002,535,424
7Jan 23, 2025 09:0429,157989,119,595903,217,00058,948,0002,289,664
8Jan 23, 2025 09:0429,163988,618,855907,422,00054,965,0002,510,848
9Jan 23, 2025 09:0429,196989,994,481898,489,00064,963,0002,416,640