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 14, 2026 23:52Josu San MartinJosu San MartinScore: 3,567Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 14, 2026 23:533,542125,642,516115,904,0001,012,0002,113,536
2May 14, 2026 23:533,546126,544,297116,040,0001,010,0002,113,536
3May 14, 2026 23:533,548126,755,880116,104,0001,012,0002,113,536
4May 14, 2026 23:533,556126,669,260116,355,0001,010,0002,113,536
5May 14, 2026 23:533,567129,319,836116,723,0001,010,0002,113,536
6May 14, 2026 23:533,571128,313,876116,858,0001,010,0002,113,536
7May 14, 2026 23:533,575128,003,821116,991,0001,011,0002,113,536
8May 14, 2026 23:533,579127,880,187117,119,0001,010,0002,113,536
9May 14, 2026 23:533,584127,825,128117,285,0001,012,0002,113,536