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 27, 2022 07:02Bernard 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 27, 2022 07:0200000Error: expected "1025328 ", got "1025327"
2Aug 27, 2022 07:0315,540569,719,128512,827,90302,281,472
3Aug 27, 2022 07:0315,557569,635,664513,385,82902,281,472
4Aug 27, 2022 07:0315,606588,922,308514,986,39602,285,568
5Aug 27, 2022 07:0315,624586,351,118515,597,79002,281,472
6Aug 27, 2022 07:0315,686587,976,073517,639,83002,281,472
7Aug 27, 2022 07:0315,723596,451,887518,869,10202,248,704