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 listMay 13, 2026 18:51Pavel SkripkinPavel SkripkinScore: 11,949Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 13, 2026 18:5210,947369,775,837358,252,0003,007,0002,117,632
2May 13, 2026 18:5211,205378,368,761366,725,0003,066,0002,117,632
3May 13, 2026 18:5211,278379,623,063369,084,0003,118,0002,117,632
4May 13, 2026 18:5211,440387,043,406374,312,0003,237,0002,117,632
5May 13, 2026 18:5211,949401,734,343391,206,0003,116,0002,117,632
6May 13, 2026 18:5212,363418,406,913404,868,0003,143,0002,117,632
7May 13, 2026 18:5212,766430,184,440418,113,0003,197,0002,117,632
8May 13, 2026 18:5212,779429,212,498418,437,0003,285,0002,117,632
9May 13, 2026 18:5212,859431,757,565421,217,0003,150,0002,117,632