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 13:38Bernard 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 13:3800000Error: expected "1026698 ", got "1026697"
2Aug 29, 2022 13:3800000Error: expected "1022112 ", got "1022119"
3Aug 29, 2022 13:3800000Error: expected "1026480 ", got "1026481"
4Aug 29, 2022 13:3900000Error: expected "1021554 ", got "1021559"
5Aug 29, 2022 13:3900000Error: expected "1022962 ", got "1022961"
6Aug 29, 2022 13:397,215301,722,322238,086,51302,289,664
7Aug 29, 2022 13:397,293311,279,612240,662,42502,293,760
8Aug 29, 2022 13:397,462305,644,014246,258,97002,289,664