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:26Marco BarboneMarco BarboneScore: 46,730Success
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:2646,4471,558,068,6701,518,763,00013,988,0002,277,376
2Oct 12, 2025 03:2646,5771,567,374,9101,525,043,00011,992,0002,318,336
3Oct 12, 2025 03:2646,6061,566,959,9921,523,003,00014,990,0002,359,296
4Oct 12, 2025 03:2646,6551,575,134,7621,525,642,00013,987,0002,326,528
5Oct 12, 2025 03:2646,7301,576,070,1351,526,094,00015,990,0002,326,528
6Oct 12, 2025 03:2646,8431,582,635,1501,527,821,00017,986,0002,322,432
7Oct 12, 2025 03:2647,3321,591,478,6271,545,999,00015,969,0002,338,816
8Oct 12, 2025 03:2647,3381,595,615,1971,544,169,00017,978,0002,330,624
9Oct 12, 2025 03:2647,8011,613,608,9041,561,457,00015,963,0002,396,160