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 06:07Josu San MartinJosu San MartinScore: 3,511Success
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 06:083,497124,230,096114,283,0001,129,0002,113,536
2May 13, 2026 06:083,502131,875,931114,484,0001,098,0002,113,536
3May 13, 2026 06:083,507126,276,957114,641,0001,122,0002,113,536
4May 13, 2026 06:083,510125,487,794114,723,0001,121,0002,113,536
5May 13, 2026 06:083,511126,770,138114,758,0001,126,0002,113,536
6May 13, 2026 06:083,513125,066,599114,807,0001,133,0002,113,536
7May 13, 2026 06:083,514126,621,825114,833,0001,134,0002,113,536
8May 13, 2026 06:083,515126,706,439114,890,0001,130,0002,113,536
9May 13, 2026 06:083,520126,918,428115,053,0001,114,0002,113,536