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 23:35Andrew EpsteinAndrew EpsteinScore: 2,717Success
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 23:362,70198,503,53587,854,0001,279,0002,117,632
2Oct 30, 2026 23:362,71298,936,25388,245,0001,276,0002,117,632
3Oct 30, 2026 23:362,71699,023,84288,375,0001,278,0002,117,632
4Oct 30, 2026 23:362,71699,001,96188,625,0001,024,0002,117,632
5Oct 30, 2026 23:362,71799,077,95388,420,0001,266,0002,117,632
6Oct 30, 2026 23:362,73899,769,67489,343,0001,013,0002,117,632
7Oct 30, 2026 23:362,74599,954,21889,579,0001,008,0002,117,632
8Oct 30, 2026 23:362,762100,542,47090,167,0001,008,0002,117,632
9Oct 30, 2026 23:362,768100,740,47090,339,0001,020,0002,117,632