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 03:56Josu San MartinJosu San MartinScore: 3,542Success
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 03:573,529127,530,529115,408,0001,059,0002,113,536
2May 13, 2026 03:573,536127,126,817115,647,0001,058,0002,113,536
3May 13, 2026 03:573,541128,308,573115,782,0001,079,0002,113,536
4May 13, 2026 03:573,542127,821,106115,780,0001,117,0002,113,536
5May 13, 2026 03:573,542127,710,385115,863,0001,032,0002,113,536
6May 13, 2026 03:573,544127,354,059115,839,0001,115,0002,113,536
7May 13, 2026 03:573,547127,264,036115,969,0001,114,0002,113,536
8May 13, 2026 03:573,549127,632,343116,005,0001,133,0002,113,536
9May 13, 2026 03:573,555128,885,855116,204,0001,127,0002,113,536