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 listOct 12, 2025 03:04Marco BarboneMarco BarboneScore: 46,992Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 12, 2025 03:0446,5231,561,792,9611,524,261,00010,994,0002,310,144
2Oct 12, 2025 03:0446,5491,564,902,4101,524,135,00011,993,0002,306,048
3Oct 12, 2025 03:0446,6681,569,819,1141,523,048,00016,989,0002,277,376
4Oct 12, 2025 03:0446,7831,571,632,3541,526,846,00016,987,0002,379,776
5Oct 12, 2025 03:0446,9921,583,154,3811,536,750,00013,979,0002,359,296
6Oct 12, 2025 03:0447,0091,579,776,2311,536,302,00014,993,0002,428,928
7Oct 12, 2025 03:0447,4661,600,440,5461,553,390,00012,978,0002,318,336
8Oct 12, 2025 03:0447,7861,613,101,5131,562,977,00013,972,0002,412,544
9Oct 12, 2025 03:0447,8311,612,031,4961,564,442,00013,968,0002,367,488