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 31, 2026 01:04Andrew EpsteinAndrew EpsteinScore: 2,748Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 31, 2026 01:122,65596,867,82886,360,0001,285,0002,113,536
2Oct 31, 2026 01:122,66097,167,35586,775,0001,035,0002,113,536
3Oct 31, 2026 01:122,69098,055,30987,517,0001,254,0002,113,536
4Oct 31, 2026 01:122,73099,429,36288,857,0001,252,0002,113,536
5Oct 31, 2026 01:122,74899,958,06989,424,0001,270,0002,113,536
6Oct 31, 2026 01:122,749100,108,27789,729,0001,014,0002,113,536
7Oct 31, 2026 01:122,751100,210,52989,771,0001,015,0002,113,536
8Oct 31, 2026 01:122,755100,292,88489,679,0001,259,0002,113,536
9Oct 31, 2026 01:122,777100,922,88390,644,0001,008,0002,113,536