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 12:12Josu San MartinJosu San MartinScore: 3,538Success
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 12:133,502124,324,622114,334,0001,235,0002,113,536
2May 13, 2026 12:133,511125,647,170114,870,0001,005,0002,113,536
3May 13, 2026 12:133,532126,137,091115,342,0001,246,0002,113,536
4May 13, 2026 12:133,533127,146,843115,346,0001,255,0002,113,536
5May 13, 2026 12:133,538126,360,865115,515,0001,253,0002,113,536
6May 13, 2026 12:133,541127,507,772115,590,0001,268,0002,113,536
7May 13, 2026 12:133,542125,678,260115,662,0001,243,0002,113,536
8May 13, 2026 12:133,545126,750,585115,748,0001,262,0002,113,536
9May 13, 2026 12:133,551128,201,656115,932,0001,278,0002,113,536