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 listAug 25, 2022 12:50Bernard TeoBernard TeoScore: 15,785Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 25, 2022 13:1615,602588,831,228514,878,86602,277,376
2Aug 25, 2022 13:1615,643587,816,068516,231,98702,273,280
3Aug 25, 2022 13:1615,697575,985,239517,997,23002,269,184
4Aug 25, 2022 12:5015,785586,955,908520,921,18602,252,800
5Aug 25, 2022 12:5015,846585,324,571522,924,44302,277,376
6Aug 25, 2022 12:5016,481609,071,181543,862,70902,285,568