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:56Josu San MartinJosu San MartinScore: 4,334Success
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:574,325151,407,495140,702,0002,047,0002,113,536
2May 14, 2026 23:574,327151,532,194141,785,0001,010,0002,113,536
3May 14, 2026 23:574,333154,702,212140,978,0002,011,0002,113,536
4May 14, 2026 23:574,334153,460,382142,029,0001,008,0002,113,536
5May 14, 2026 23:574,334153,819,232141,004,0002,032,0002,113,536
6May 14, 2026 23:574,342153,738,717142,310,0001,008,0002,113,536
7May 14, 2026 23:574,347152,982,239141,444,0002,025,0002,113,536
8May 14, 2026 23:574,353153,738,032142,659,0001,008,0002,113,536
9May 14, 2026 23:574,358155,626,533142,823,0001,011,0002,113,536