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 03:09Andrew EpsteinAndrew EpsteinScore: 3,057Success
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 03:113,011110,844,19798,341,0001,042,0002,113,536
2Oct 30, 2026 03:113,020111,133,48198,658,0001,031,0002,113,536
3Oct 30, 2026 03:113,036111,663,80199,188,0001,028,0002,113,536
4Oct 30, 2026 03:113,050111,528,80199,640,0001,027,0002,113,536
5Oct 30, 2026 03:113,057112,315,95799,844,0001,040,0002,113,536
6Oct 30, 2026 03:113,060111,920,45099,957,0001,033,0002,113,536
7Oct 30, 2026 03:113,080113,164,805100,625,0001,046,0002,113,536
8Oct 30, 2026 03:113,118114,384,980101,903,0001,021,0002,113,536
9Oct 30, 2026 03:113,250118,742,248105,236,0002,040,0002,113,536