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 listDec 29, 2024 17:18Yuriy LyfenkoYuriy LyfenkoScore: 8,549Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 29, 2024 17:118,477302,648,271274,740,0004,995,0002,445,312
2Dec 29, 2024 17:118,510302,576,797274,832,0005,996,0002,510,848
3Dec 29, 2024 17:188,530307,126,403274,513,0006,987,0002,330,624
4Dec 29, 2024 17:118,549309,285,490275,127,0007,003,0002,514,944
5Dec 29, 2024 17:188,634307,457,587279,936,0004,998,0002,514,944
6Dec 29, 2024 17:188,878313,510,388287,966,0004,999,0002,502,656