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 05:52Josu San MartinJosu San MartinScore: 3,483Success
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 05:533,479125,623,921113,739,0001,081,0002,113,536
2May 13, 2026 05:533,481123,691,563113,773,0001,115,0002,113,536
3May 13, 2026 05:533,482123,906,173113,811,0001,110,0002,113,536
4May 13, 2026 05:533,483123,721,397113,833,0001,107,0002,113,536
5May 13, 2026 05:533,483126,702,615113,924,0001,040,0002,113,536
6May 13, 2026 05:533,486124,458,584113,939,0001,112,0002,113,536
7May 13, 2026 05:533,487124,956,611113,953,0001,122,0002,113,536
8May 13, 2026 05:533,493125,601,452114,155,0001,123,0002,113,536
9May 13, 2026 05:533,502124,879,689114,461,0001,115,0002,113,536