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 31, 2022 16:23Bernard 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 31, 2022 16:2300000Error: expected "1025688 ", got "1025685"
2Aug 31, 2022 16:2400000Error: expected "1024164 ", got "1024163"
3Aug 31, 2022 16:2400000Error: expected "1021078 ", got "1021074"
4Aug 31, 2022 16:2400000Error: expected "1021322 ", got "1021318"
5Aug 31, 2022 16:2400000Error: expected "1018459 ", got "1018457"
6Aug 31, 2022 16:2400000Error: expected "1020901 ", got "1020899"
7Aug 31, 2022 16:2400000Error: expected "1019615 ", got "1019613"
8Aug 31, 2022 16:2400000Error: expected "1026188 ", got "1026187"
9Aug 31, 2022 16:2400000Error: expected "1020001 ", got "1020000"
10Aug 31, 2022 16:2400000Error: expected "1021452 ", got "1021451"