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 30, 2026 21:39Andrew EpsteinAndrew EpsteinScore: 3,013Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 30, 2026 21:412,964107,167,60996,822,0001,016,0002,117,632
2Oct 30, 2026 21:412,990108,096,14097,686,0001,007,0002,117,632
3Oct 30, 2026 21:413,001108,934,88797,762,0001,289,0002,117,632
4Oct 30, 2026 21:413,009108,739,73498,284,0001,024,0002,117,632
5Oct 30, 2026 21:413,013108,837,66598,433,0001,023,0002,117,632
6Oct 30, 2026 21:413,021109,179,24098,672,0001,031,0002,117,632
7Oct 30, 2026 21:413,026111,250,24298,786,0001,082,0002,117,632
8Oct 30, 2026 21:413,053110,217,42299,725,0001,024,0002,117,632
9Oct 30, 2026 21:413,079111,110,641100,596,0001,036,0002,117,632