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 28, 2022 08:21Bernard TeoBernard TeoError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 28, 2022 08:2100000Error: expected "1019678 ", got "1019677"
2Aug 28, 2022 08:2111,321429,366,060373,607,38102,228,224
3Aug 28, 2022 08:2111,443442,169,151377,631,79702,285,568
4Aug 28, 2022 08:2111,450433,537,709377,860,61102,236,416
5Aug 28, 2022 08:2111,484435,798,441378,983,84602,265,088
6Aug 28, 2022 08:2111,837468,348,646390,611,43402,211,840
7Aug 28, 2022 08:2111,838456,867,491390,659,11802,183,168