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:44Josu San MartinJosu San MartinScore: 3,465Success
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:453,459124,560,430113,128,0001,046,0002,113,536
2May 14, 2026 23:453,463123,491,147113,241,0001,044,0002,113,536
3May 14, 2026 23:453,464123,353,959113,283,0001,036,0002,113,536
4May 14, 2026 23:453,464124,718,989113,289,0001,043,0002,113,536
5May 14, 2026 23:453,465125,154,715113,315,0001,041,0002,113,536
6May 14, 2026 23:453,466126,042,475113,345,0001,049,0002,113,536
7May 14, 2026 23:453,497124,897,573114,366,0001,035,0002,113,536
8May 14, 2026 23:453,499124,426,375114,455,0001,041,0002,113,536
9May 14, 2026 23:453,503125,270,448114,566,0001,055,0002,113,536