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 29, 2022 12:44Bernard 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 29, 2022 12:4400000Error: expected "1023297 ", got "2042032"
2Aug 29, 2022 12:4400000Error: expected "1026021 ", got "2047217"
3Aug 29, 2022 12:4400000Error: expected "1021140 ", got "2037872"
4Aug 29, 2022 12:4400000Error: expected "1025110 ", got "2045630"
5Aug 29, 2022 12:4400000Error: expected "1023798 ", got "2042788"
6Aug 29, 2022 12:4400000Error: expected "1022766 ", got "2040990"
7Aug 29, 2022 12:4400000Error: expected "1021638 ", got "2038568"