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 6, 2026 05:11Karthik ReddyKarthik ReddyScore: 2,840Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 6, 2026 05:122,814101,933,32591,881,0001,004,00020,480
2Oct 6, 2026 05:122,815102,137,59791,886,0001,023,00020,480
3Oct 6, 2026 05:122,832102,541,28492,433,0001,044,00020,480
4Oct 6, 2026 05:122,837102,814,68092,589,0001,060,00020,480
5Oct 6, 2026 05:122,840102,789,44892,677,0001,073,00020,480
6Oct 6, 2026 05:122,842102,836,59592,781,0001,013,00020,480
7Oct 6, 2026 05:122,843102,900,69992,826,0001,009,00020,480
8Oct 6, 2026 05:122,848103,802,95392,992,0001,004,00020,480
9Oct 6, 2026 05:122,895104,591,40494,501,0001,059,00020,480