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 listOct 14, 2024 06:49Vladimir TatVladimir TatScore: 77,143Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 14, 2024 06:4976,9002,565,695,0652,380,843,000156,857,0002,445,312
2Oct 14, 2024 06:4977,1432,577,918,0322,386,847,000158,856,0002,318,336
3Oct 14, 2024 06:4977,5312,586,239,0712,392,695,000165,840,0002,445,312